Copertina

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Vakhania, Nodari, Werner, Frank, Ramírez-Fuentes, Kevin Johedan, Pacheco-Valencia, Víctor
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms 90B35 (Primary), 90C59 (Secondary)
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An online joint replenishment problem combined with single machine scheduling
di: Györgyi, Péter, et al.
Pubblicazione: (2022)

Compact enumeration for scheduling one machine
di: Vakhania, Nodari
Pubblicazione: (2021)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
di: Aref, Samin, et al.
Pubblicazione: (2025)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
di: Ardizzoni, Stefano, et al.
Pubblicazione: (2021)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
di: Ammann, Sabrina C. L., et al.
Pubblicazione: (2024)

Reducing Dominating Sets in Graphs
di: Inza, Ernesto Parra, et al.
Pubblicazione: (2024)

Metaheuristic algorithms for the induced P-median problem with upgrades
di: Salazar, Sergio, et al.
Pubblicazione: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
di: Kim, Junyoung, et al.
Pubblicazione: (2024)

Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
di: Aref, Samin, et al.
Pubblicazione: (2022)

Heuristic algorithms for the stochastic critical node detection problem
di: Bayarsaikhan, Tuguldur, et al.
Pubblicazione: (2025)

An efficient recursive decomposition algorithm for undirected graphs
di: Heng, Pei, et al.
Pubblicazione: (2026)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
di: da Silva, Renan F. F., et al.
Pubblicazione: (2026)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
di: da Silva, Renan Fernando Franco, et al.
Pubblicazione: (2026)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
di: Gonçalves-Dosantos, Juan Carlos, et al.
Pubblicazione: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

A priority-driven constructive heuristic for assigning and scheduling spontaneous volunteers in disaster response
di: Sperling, Martina
Pubblicazione: (2026)

An ODE approach to multiple choice polynomial programming
di: Shao, Sihong, et al.
Pubblicazione: (2022)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
di: Diaby, Moustapha, et al.
Pubblicazione: (2023)

An improved approximation algorithm for k-Median
di: Young, Neal E.
Pubblicazione: (2025)

Column-generation for a two-dimensional multi-criteria bin-packing problem
di: Groschke, Christof, et al.
Pubblicazione: (2025)

The Competition Complexity of Prophet Inequalities
di: Brustle, Johannes, et al.
Pubblicazione: (2024)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
di: Badenbroek, Riley, et al.
Pubblicazione: (2024)

Implicit Decision Diagrams
di: Rudich, Isaac, et al.
Pubblicazione: (2026)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
di: Yuan, Qilong
Pubblicazione: (2025)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

Finding Short Paths on Simple Polytopes
di: Black, Alexander E., et al.
Pubblicazione: (2026)

Perpertual Coupled Simulated Annealing for Continuous Optimization
di: Gonçalves-e-Silva, Kayo, et al.
Pubblicazione: (2018)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
di: Loris, Ignace, et al.
Pubblicazione: (2023)

An $n^{O(\log\log n)}$ time approximation scheme for capacitated VRP in the Euclidean plane
di: Sitters, René
Pubblicazione: (2025)

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

Strongly-polynomial time and validation analysis of policy gradient methods
di: Ju, Caleb, et al.
Pubblicazione: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
di: Dörfler, Daniel, et al.
Pubblicazione: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
di: Ozturk, Berk, et al.
Pubblicazione: (2025)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
di: Baxi, Saumil, et al.
Pubblicazione: (2025)

Coach Reservation for Groups Requests
di: Cardonha, Carlos H., et al.
Pubblicazione: (2024)