Mixed-integer linear programming heuristics for the prepack optimization problem
From MaRDI portal
Publication:1751183
DOI10.1016/j.disopt.2015.03.004zbMath1387.90157OpenAlexW2137521424MaRDI QIDQ1751183
Matteo Fischetti, Domenico Salvagnin, Michele Monaci
Publication date: 24 May 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2015.03.004
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Related Items
Integrated optimization on assortment packing and collaborative shipping for fashion clothing ⋮ A new interactive approach for solving fully fuzzy mixed integer linear programming
Uses Software
Cites Work
- Unnamed Item
- SCIP: solving constraint integer programs
- Variable neighborhood search
- Algorithms for packing and scheduling problems. (Abstract of thesis)
- Two-dimensional packing problems: a survey
- Measuring the impact of primal heuristics
- Solving the variable size bin packing problem with discretized formulations
- Branching and bounds tighteningtechniques for non-convex MINLP
- Rounding and Propagation Heuristics for Mixed Integer Programming