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

DOI10.1007/978-3-030-58150-3_34OpenAlexW3082326543MaRDI QIDQ2019488

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

integer linear programmingcutting planebin packing

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry

Cites Work

• Unnamed Item
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Lower bounds and reduction procedures for the bin packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• BPPLIB: a library for bin packing and cutting stock problems
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• A New Linear Programming Approach to the Cutting Stock Problem

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