Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
From MaRDI portal
Publication:2362175
DOI10.1007/s00291-016-0463-xzbMath1371.90066OpenAlexW2224455590MaRDI QIDQ2362175
Publication date: 6 July 2017
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-016-0463-x
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Consistency Cuts for Dantzig-Wolfe Reformulations ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ A combinatorial flow-based formulation for temporal bin packing problems ⋮ An iterative dynamic programming approach for the temporal knapsack problem ⋮ Dual Inequalities for Stabilized Column Generation Revisited ⋮ A branch-and-price algorithm for the temporal bin packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- Chebyshev center based column generation
- Stabilized column generation
- Row-reduced column generation for degenerate master problems
- Interior point stabilization for column generation
- Dual Inequalities for Stabilized Column Generation Revisited
- Using Extra Dual Cuts to Accelerate Column Generation
- A Linear Programming Approach to the Cutting-Stock Problem
- Dual-Optimal Inequalities for Stabilized Column Generation
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- Column Generation
- Selected Topics in Column Generation
- The Temporal Knapsack Problem and Its Solution
- Implementing Mixed Integer Column Generation
- Benchmarking optimization software with performance profiles.
- Solving the temporal knapsack problem via recursive Dantzig-Wolfe reformulation
This page was built for publication: Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
