Exploiting Packing Components in General-Purpose Integer Programming Solvers

DOI10.1007/978-3-319-18899-7_10zbMath1390.90471arXiv1412.2526OpenAlexW1893610253MaRDI QIDQ4634979

Jakub Mareček

Publication date: 13 April 2018

Published in: Optimized Packings with Applications (Search for Journal in Brave)

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

zbMATH Keywords

integer programmingpackingstructure exploitationmulti-dimensional packing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• A space-indexed formulation of packing boxes into a larger box
• Modeling and optimization in space engineering.
• The three-dimensional knapsack problem with balancing constraints
• SCIP: solving constraint integer programs
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• Hardness of approximation for orthogonal rectangle packing and covering problems
• MIP-based heuristic for non-standard 3D-packing problems
• An analytical model for the container loading problem
• A time indexed formulation of non-preemptive single machine scheduling problems
• Packing small boxes into a big box.
• Three-dimensional container loading models with cargo stability and load bearing constraints
• Algorithms for 3D guillotine cutting problems: unbounded knapsack, cutting stock and strip packing
• A MIP approach for some practical packing problems: balancing constraints and tetris-like items
• Large-scale multi-period precedence constrained knapsack problem: A mining application
• Solving LP Relaxations of Large-Scale Precedence Constrained Problems
• Probabilistic Analysis of Geometric Location Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• On the complexity of unique solutions
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Glass cutting in a small firm
• The Three-Dimensional Bin Packing Problem
• Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints
• Multistage Cutting Stock Problems of Two and More Dimensions
• Solving Non-standard Packing Problems by Global Optimization and Heuristics
• Cutting Stock Problems
• Recursive Computational Procedure for Two-dimensional Stock Cutting

This page was built for publication: Exploiting Packing Components in General-Purpose Integer Programming Solvers