Imagen de Portada

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

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Vakhania, Nodari, Werner, Frank, Ramírez-Fuentes, Kevin Johedan, Pacheco-Valencia, Víctor
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms 90B35 (Primary), 90C59 (Secondary)
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Compact enumeration for scheduling one machine
por: Vakhania, Nodari
Publicado: (2021)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Implicit Decision Diagrams
por: Rudich, Isaac, et al.
Publicado: (2026)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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