Mathematical programming algorithms for bin packing problems with item fragmentation

DOI10.1016/J.COR.2013.12.008zbMath1348.90536OpenAlexW2088827022MaRDI QIDQ336982

Marco Casazza, Alberto Ceselli

Publication date: 10 November 2016

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

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

zbMATH Keywords

mathematical programmingbranch-and-pricebin packingitem fragmentation

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (14)

Integer optimization with penalized fractional values: the knapsack case ⋮ Approximation issues of fractional knapsack with penalties: a note ⋮ Resource loading with time windows ⋮ Procedures for the bin packing problem with precedence constraints ⋮ Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ Exactly solving packing problems with fragmentation ⋮ 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 ⋮ A study on load-balanced variants of the bin packing problem ⋮ Column generation for the variable cost and size bin packing problem with fragmentation ⋮ Numerical optimization method for packing regular convex polygons ⋮ Bin packing problem with conflicts and item fragmentation ⋮ A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Branching in branch-and-price: A generic scheme
• SCIP: solving constraint integer programs
• Minimizing makespan and preemption costs on a system of uniform machines
• Routing and wavelength assignment in optical networks using bin packing based algorithms
• Parallelism versus memory allocation in pipelined router forwarding engines
• Complexity of fragmentable object bin packing and an application
• 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
• 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
• Vehicle routing problems with split deliveries
• Approximation and Online Algorithms

This page was built for publication: Mathematical programming algorithms for bin packing problems with item fragmentation