Parameterized complexity of configuration integer programs
From MaRDI portal
Publication:2670456
DOI10.1016/j.orl.2021.11.005OpenAlexW3212136253MaRDI QIDQ2670456
Dušan Knop, Matthias Mnich, Martin Koutecký, Shmuel Onn, Asaf Levin
Publication date: 11 March 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2021.11.005
Related Items (1)
Cites Work
- Unnamed Item
- An application of simultaneous diophantine approximation in combinatorial optimization
- Bin packing can be solved within 1+epsilon in linear time
- On integer points in polyhedra
- Approximation schemes for scheduling on parallel machines
- Bin packing with fixed number of bins revisited
- Cardinality constrained bin-packing problems
- Combinatorial \(n\)-fold integer programming and applications
- Huge multiway table problems
- Bin packing with general cost structures
- Parallel Machine Scheduling by Column Generation
- A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
- A Linear Programming Approach to the Cutting-Stock Problem
- About the Structure of the Integer Cone and Its Application to Bin Packing
- Minkowski's Convex Body Theorem and Integer Programming
- Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
- Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
- A Logarithmic Additive Integrality Gap for Bin Packing
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Parameterized Algorithms
This page was built for publication: Parameterized complexity of configuration integer programs
