Avoiding redundant columns by adding classical Benders cuts to column generation subproblems
From MaRDI portal
Publication:2019426
DOI10.1016/j.disopt.2021.100626zbMath1506.90172OpenAlexW3126837002MaRDI QIDQ2019426
Marco E. Lübbecke, Stephen J. Maher, Jonas T. Witt
Publication date: 21 April 2021
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2021.100626
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SCIP: solving constraint integer programs
- Column generation in the integral simplex method
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A Lagrangian-based heuristic for large-scale set covering problems
- Cost based filtering for the constrained knapsack problem
- An integer optimality condition for column generation on zero-one linear programs
- A generic view of Dantzig--Wolfe decomposition in mixed integer programming
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times
- Integral Simplex Using Decomposition for the Set Partitioning Problem
- Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
- A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem
- Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times
- Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem
- A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times
- On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
- Selected Topics in Column Generation
- A Primer in Column Generation
- Constraint programming based column generation for crew assignment
