Exactly solving packing problems with fragmentation

DOI10.1016/j.cor.2016.06.007zbMath1349.90708OpenAlexW2431379199MaRDI QIDQ342536

Marco Casazza, Alberto Ceselli

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.06.007

zbMATH Keywords

mathematical programmingbranch-and-pricebin packingitem fragmentation

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Related Items (10)

Integer optimization with penalized fractional values: the knapsack case ⋮ Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems ⋮ Column generation for the variable cost and size bin packing problem with fragmentation ⋮ Bin packing problem with conflicts and item fragmentation

Uses Software

• CPLEX

Cites Work

• Branch-and-cut algorithms for the split delivery vehicle routing problem
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Bin packing with fragmentable items: presentation and approximations
• SCIP: solving constraint integer programs
• Parallelism versus memory allocation in pipelined router forwarding engines
• Approximation schemes for packing with item fragmentation
• Complexity of fragmentable object bin packing and an application
• Exact algorithms for the bin packing problem with fragile objects
• LP models for bin packing and cutting stock problems
• Approximation schemes for packing splittable items with cardinality constraints
• Improved results for a memory allocation problem
• Dual Inequalities for Stabilized Column Generation Revisited
• Using Extra Dual Cuts to Accelerate Column Generation
• Decomposition Principle for Linear Programs
• A Linear Programming Approach to the Cutting-Stock Problem
• The Bin Packing Problem with Precedence Constraints
• Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
• Unnamed Item
• Unnamed Item

This page was built for publication: Exactly solving packing problems with fragmentation