About the Structure of the Integer Cone and Its Application to Bin Packing

DOI10.1287/moor.2019.1040zbMath1456.90134arXiv1604.07286OpenAlexW3042748189MaRDI QIDQ3387933

Kim-Manuel Klein, Klaus Jansen

Publication date: 8 January 2021

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07286

zbMATH Keywords

integer programmingbin packingstructural properties

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

Parameterized complexity of configuration integer programs ⋮ Fair and efficient allocation with few agent types, few item types, or small value levels ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The vertices of the knapsack polytope
• On integer points in polyhedra
• Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
• Diophantine approximations and integer points of cones
• Friendly bin packing instances without integer round-up property
• Carathéodory bounds for integer cones
• A Polynomial Time OPT + 1 Algorithm for the Cutting Stock Problem with a Constant Number of Object Lengths
• Integer Programming with a Fixed Number of Variables
• New Hardness Results for Diophantine Approximation
• Minkowski's Convex Body Theorem and Integer Programming
• A Logarithmic Additive Integrality Gap for Bin Packing
• Polynomiality for Bin Packing with a Constant Number of Item Types

This page was built for publication: About the Structure of the Integer Cone and Its Application to Bin Packing