Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
From MaRDI portal
Publication:2572248
Recommendations
- An exact algorithm for the dual bin packing problem
- Stabilized branch-and-price algorithms for vector packing problems
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Branch-and-price algorithms for the one-dimensional cutting stock problem
Cites work
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- An exact algorithm for IP column generation
- An exact algorithm for the dual bin packing problem
- Bin packing: Maximizing the number of pieces packed
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Dual bin packing with items of random sizes
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Probabilistic bounds for dual bin-packing
- Routing with time windows by column generation
Cited in
(23)- The skiving stock problem and its relation to hypergraph matchings
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
- Integer rounding and modified integer rounding for the skiving stock problem
- Lower bounds and algorithms for the minimum cardinality bin covering problem
- An exact algorithm for the dual bin packing problem
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- Solving robust bin-packing problems with a branch-and-price approach
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
- A lexicographic pricer for the fractional bin packing problem
- Improved flow-based formulations for the skiving stock problem
- A branch-and-price algorithm for the temporal bin packing problem
- Improved approaches to the exact solution of the machine covering problem
- Large proper gaps in bin packing and dual bin packing problems
- Integer linear programming models for the skiving stock problem
- Branch and Price for Chance-Constrained Bin Packing
- Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
- The proper relaxation and the proper gap of the skiving stock problem
- The Co-Printing Problem: A Packing Problem with a Color Constraint
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
- Branch and Price for Submodular Bin Packing
- Stabilized branch-and-price algorithms for vector packing problems
- Bi-objective knapsack problem with conflicts
This page was built for publication: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2572248)
