An exact algorithm for the dual bin packing problem
From MaRDI portal
Publication:1892657
DOI10.1016/0167-6377(94)00060-JzbMath0835.90077OpenAlexW1973063017WikidataQ89138447 ScholiaQ89138447MaRDI QIDQ1892657
Martine Labbé, Gilbert Laporte, Silvano Martello
Publication date: 19 June 1995
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(94)00060-j
Related Items
Improved filtering for the bin-packing with cardinality constraint, Integer linear programming models for the skiving stock problem, The skiving stock problem as a counterpart of the cutting stock problem, BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem, Models and complexity of multibin packing problems, Improved approaches to the exact solution of the machine covering problem, The skiving stock problem and its relation to hypergraph matchings, Upper bounds and algorithms for the maximum cardinality bin packing problem., Large proper gaps in bin packing and dual bin packing problems, Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model, Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case, The proper relaxation and the proper gap of the skiving stock problem, Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory, Integer rounding and modified integer rounding for the skiving stock problem, Lower bounds and algorithms for the minimum cardinality bin covering problem, Lower bounds for a bin packing problem with linear usage cost, Timing analysis of the flexRay communication protocol, An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case, Properties of some ILP formulations of a class of partitioning problems, Improved flow-based formulations for the skiving stock problem, Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic bounds for dual bin-packing
- Online algorithms for a dual version of bin packing
- Probabilistic analysis of a heuristic for the dual bin packing problem
- On a dual version of the one-dimensional bin packing problem
- Probabilistic analysis of algorithms for dual bin packing problems
