A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
From MaRDI portal
Publication:3386775
DOI10.1287/ijoc.2018.0867OpenAlexW2985659520WikidataQ126842248 ScholiaQ126842248MaRDI QIDQ3386775
Andrew E. B. Lim, Lijun Wei, Roberto Baldacci, Zhi-Xing Luo
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2018.0867
Related Items
An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ 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 ⋮ An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Bin Packing Problem with Time Lags ⋮ 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 generic exact solver for vehicle routing and related problems ⋮ A large neighborhood search algorithm and lower bounds for the variable-sized bin packing problem with conflicts ⋮ Exact solution of network flow models with strong relaxations ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Two exact algorithms for the traveling umpire problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Single liner shipping service design
- Bin packing and related problems: general arc-flow formulation with graph compression
- An exact approach for the vertex coloring problem
- Branching in branch-and-price: A generic scheme
- An instance of the cutting stock problem for which the rounding property does not hold
- The modified integer round-up property of the one-dimensional cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Solving binary cutting stock problems by column generation and branch- and-bound
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- BPPLIB: a library for bin packing and cutting stock problems
- Heuristics and lower bounds for the bin packing problem with conflicts
- LP models for bin packing and cutting stock problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- An approximation scheme for bin packing with conflicts
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- Friendly bin packing instances without integer round-up property
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Edmonds polytopes and a hierarchy of combinatorial problems
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Mathematical Methods of Organizing and Planning Production
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Column Generation based Primal Heuristics
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Algorithms for the Bin Packing Problem with Conflicts
- A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
- A Metaheuristic Approach for the Vertex Coloring Problem
- An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- Consistency Check for the Bin Packing Constraint Revisited
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- An Additive Algorithm for Solving Linear Programs with Zero-One Variables
- The Loading Problem
- Principles and Practice of Constraint Programming – CP 2004
This page was built for publication: A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
