Solving robust bin-packing problems with a branch-and-price approach
From MaRDI portal
Publication:2060393
DOI10.1016/j.ejor.2021.05.041zbMath1490.90256OpenAlexW3168953250MaRDI QIDQ2060393
Xavier Schepler, André Rossi, Alexandre Dolgui, Evgeny E. Gurevsky
Publication date: 13 December 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.psl.eu/handle/123456789/22655
uncertaintyrobustnesssensitivity analysiscolumn generationDantzig-Wolfe decompositionpackingstability radiusbranch-and-pricerelative resiliency
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Cutting and packing problems under uncertainty: literature review and classification framework ⋮ One-dimensional stock cutting resilient against singular random defects ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
Cites Work
- Unnamed Item
- Maximizing the robustness for simple assembly lines with fixed cycle time and limited number of workstations
- Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- On the cutting stock problem under stochastic demand
- ZI round, a MIP rounding heuristic
- Operating room planning and scheduling: a literature review
- Dynamic programming algorithms for the zero-one knapsack problem
- A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
- 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
- A fast algorithm for the maximum clique problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- A classification of assembly line balancing problems
- A stochastic model for operating room planning with elective and emergency demand for surgery
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- Stability analysis of an optimal balance for an assembly line with fixed cycle time
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A branch-and-price-and-cut approach for sustainable crop rotation planning
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Decomposition Principle for Linear Programs
- The Price of Robustness
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Computing Partitions with Applications to the Knapsack Problem
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Rounding and Propagation Heuristics for Mixed Integer Programming
- Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Heuristics of the Branch-Cut-and-Price-Framework SCIP
- The omnipresence of Lagrange
