New symmetry-less ILP formulation for the classical one dimensional bin-packing problem

DOI10.1007/978-3-030-58150-3_34MaRDI QIDQ2019488zbMATH OpenOpenAlexFDO

Authors Khadija Hadj Salem, Yann Kieffer

Publication date 21 April 2021

Full work available at URL https://doi.org/10.1007/978-3-030-58150-3_34

zbMATH Keywords

bin packingcutting planeinteger linear programming

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Cites work

• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A New Linear Programming Approach to the Cutting Stock Problem
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• BPPLIB: a library for bin packing and cutting stock problems
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• Lower bounds and reduction procedures for the bin packing problem
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

Cited in

(2)

• Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
• Compact formulations and valid inequalities for parallel machine scheduling with conflicts

This page was built for publication: New symmetry-less ILP formulation for the classical one dimensional bin-packing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019488)