An integer programming column generation principle for heuristic search methods
From MaRDI portal
Publication:6066729
DOI10.1111/itor.12521OpenAlexW2790797650WikidataQ61940972 ScholiaQ61940972MaRDI QIDQ6066729
Elina Rönnberg, Torbjörn Larsson, YiXin Zhao
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12521
Related Items (4)
Dissecting the duality gap: the supporting hyperplane interpretation revisited ⋮ A theoretical justification of the set covering greedy heuristic of Caprara et al. ⋮ Integral Column Generation for Set Partitioning Problems with Side Constraints ⋮ Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
Cites Work
- Unnamed Item
- Decomposition based hybrid metaheuristics
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- An exact method with variable fixing for solving the generalized assignment problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A set partitioning heuristic for the generalized assignment problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- Hybrid metaheuristics. 7th international workshop, HM 2010, Vienna, Austria, October 1--2, 2010. Proceedings
- Power efficient uplink scheduling in SC-FDMA: benchmarking by column generation
- Column Generation based Primal Heuristics
- Global Optimality Conditions for Discrete and Nonconvex Optimization—With Applications to Lagrangian Heuristics and Column Generation
- A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A Column Generation Approach for Large-Scale Aircrew Rostering Problems
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- Selected Topics in Column Generation
- Searching for optimal integer solutions to set partitioning problems using column generation
This page was built for publication: An integer programming column generation principle for heuristic search methods
