Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Vakhania, Nodari, Werner, Frank, Ramírez-Fuentes, Kevin Johedan, Pacheco-Valencia, Víctor
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms 90B35 (Primary), 90C59 (Secondary)
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An online joint replenishment problem combined with single machine scheduling
par: Györgyi, Péter, et autres
Publié: (2022)

Compact enumeration for scheduling one machine
par: Vakhania, Nodari
Publié: (2021)

Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
par: Aref, Samin, et autres
Publié: (2025)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
par: Ardizzoni, Stefano, et autres
Publié: (2021)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
par: Ammann, Sabrina C. L., et autres
Publié: (2024)

Reducing Dominating Sets in Graphs
par: Inza, Ernesto Parra, et autres
Publié: (2024)

Metaheuristic algorithms for the induced P-median problem with upgrades
par: Salazar, Sergio, et autres
Publié: (2026)

Non-convex relaxation and 1/2-approximation algorithm for the chance-constrained binary knapsack problem
par: Kim, Junyoung, et autres
Publié: (2024)

Bayan Algorithm: Detecting Communities in Networks Through Exact and Approximate Optimization of Modularity
par: Aref, Samin, et autres
Publié: (2022)

Heuristic algorithms for the stochastic critical node detection problem
par: Bayarsaikhan, Tuguldur, et autres
Publié: (2025)

An efficient recursive decomposition algorithm for undirected graphs
par: Heng, Pei, et autres
Publié: (2026)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
par: Halbig, Katrin, et autres
Publié: (2024)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
par: da Silva, Renan F. F., et autres
Publié: (2026)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
par: da Silva, Renan Fernando Franco, et autres
Publié: (2026)

Two-stage heuristic algorithm for a new variant of the multi-compartment vehicle routing problem with stochastic demands
par: Gonçalves-Dosantos, Juan Carlos, et autres
Publié: (2024)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
par: Borges, Jennifer C., et autres
Publié: (2026)

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

An ODE approach to multiple choice polynomial programming
par: Shao, Sihong, et autres
Publié: (2022)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
par: Diaby, Moustapha, et autres
Publié: (2023)

An improved approximation algorithm for k-Median
par: Young, Neal E.
Publié: (2025)

Column-generation for a two-dimensional multi-criteria bin-packing problem
par: Groschke, Christof, et autres
Publié: (2025)

The Competition Complexity of Prophet Inequalities
par: Brustle, Johannes, et autres
Publié: (2024)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
par: Badenbroek, Riley, et autres
Publié: (2024)

Implicit Decision Diagrams
par: Rudich, Isaac, et autres
Publié: (2026)

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

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
par: Dörfler, Daniel, et autres
Publié: (2020)

Finding Short Paths on Simple Polytopes
par: Black, Alexander E., et autres
Publié: (2026)

Perpertual Coupled Simulated Annealing for Continuous Optimization
par: Gonçalves-e-Silva, Kayo, et autres
Publié: (2018)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
par: Loris, Ignace, et autres
Publié: (2023)

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

Approximation algorithms for the prize-collecting rural postman problem
par: Li, Hong, et autres
Publié: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
par: Kempke, Nils-Christian, et autres
Publié: (2025)

Strongly-polynomial time and validation analysis of policy gradient methods
par: Ju, Caleb, et autres
Publié: (2024)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
par: Im, Haesol, et autres
Publié: (2024)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
par: Dörfler, Daniel, et autres
Publié: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
par: Qu, Zheng, et autres
Publié: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
par: Borgwardt, Steffen, et autres
Publié: (2026)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
par: Ozturk, Berk, et autres
Publié: (2025)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
par: Baxi, Saumil, et autres
Publié: (2025)

Coach Reservation for Groups Requests
par: Cardonha, Carlos H., et autres
Publié: (2024)