A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
From MaRDI portal
Recommendations
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A Numerically Exact Algorithm for the Bin-Packing Problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A branch-and-price algorithm for the bin packing problem with conflicts
- Solving bin packing problems using VRPSolver models
Cites work
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A branch-and-price algorithm for the bin packing problem with conflicts
- A Linear Programming Approach to the Cutting-Stock Problem
- A metaheuristic approach for the vertex coloring problem
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Algorithms for the bin packing problem with conflicts
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- An approximation scheme for bin packing with conflicts
- An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
- An exact approach for the vertex coloring problem
- An instance of the cutting stock problem for which the rounding property does not hold
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- BPPLIB: a library for bin packing and cutting stock problems
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Branch-and-price: Column generation for solving huge integer programs
- Branching in branch-and-price: A generic scheme
- Column generation based primal heuristics
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Consistency check for the bin packing constraint revisited
- Edmonds polytopes and a hierarchy of combinatorial problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Friendly bin packing instances without integer round-up property
- Heuristics and lower bounds for the bin packing problem with conflicts
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- LP models for bin packing and cutting stock problems
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Optimal integer solutions to industrial cutting-stock problems. II: Benchmark results
- Principles and Practice of Constraint Programming – CP 2004
- Single liner shipping service design
- Solving binary cutting stock problems by column generation and branch- and-bound
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- The Loading Problem
- The modified integer round-up property of the one-dimensional cutting stock problem
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- Two exact algorithms for the traveling umpire problem
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
Cited in
(26)- Branch-and-price algorithms for the one-dimensional cutting stock problem
- Solving bin packing problems using VRPSolver models
- On the benchmark instances for the bin packing problem with conflicts
- New exact techniques applied to a class of network flow formulations
- Robust drone selective routing in humanitarian transportation network assessment
- An introduction to stochastic bin packing-based server consolidation with conflicts
- A generic exact solver for vehicle routing and related problems
- An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
- Exact solution of network flow models with strong relaxations
- Parallel Machine Scheduling Under Uncertainty: Models and Exact Algorithms
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning
- Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation
- Bin Packing Problem with Time Lags
- Lower and upper bounding procedures for the bin packing problem with concave loading cost
- Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
- The parallel AGV scheduling problem with battery constraints: a new formulation and a matheuristic approach
- A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts
- A Numerically Exact Algorithm for the Bin-Packing Problem
- Algorithms for the bin packing problem with scenarios
- Arc-flow formulation and branch-and-price-and-cut algorithm for the bin-packing problem with fragile objects
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- Bounds and heuristic algorithms for the bin packing problem with minimum color fragmentation
- An exact approach for bi-objective non-identical batch processing machines scheduling
- Fast neighborhood search heuristics for the colored bin packing problem
- Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
This page was built for publication: A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3386775)
