Column Generation based Primal Heuristics
References (23)
- et al.
Improving the feasibility pump
Discrete Optim.
(2007) - et al.
A survey of very large-scale neighborhood search techniques
Workshop on Discrete Optimization, DO'99 (Piscataway, NJ)
Discrete Appl.Math.
(2002) - et al.
A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
European J. Oper. Res.
(2002) - et al.
A set-partitioning-based exact algorithm for the vehicle routing problem
Networks
(1989) - Timo Berthold. Primal Heuristics for Mixed Integer Programs. Master's thesis, Technische Universität Berlin,...
- A. Chabrier. Heuristic branch-and-price-and-cut to solve a network design problem. In Proceedings CPAIOR, Montreal,...
- A. Chabrier, E. Danna, and C. Le Pape. Coopération entre génération de colonnes et recherche locale appliquées au...
- et al.
Exploring relaxation induced neighborhoods to improve MIP solutions
Math. Program Ser. A
(2005) - et al.
A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot-sizing problem with setup times
Oper. Res.
(2007) - et al.
Algorithms for the bin packing problem with conflicts
INFORMS Journal on Computing
(2009)
The feasibility pump
Math.Program. Ser. A
(2005)
Cited by (93)
An improved column-generation-based matheuristic for learning classification trees
2024, Computers and Operations ResearchSolving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints
2023, European Journal of Operational ResearchAdaptive solution prediction for combinatorial optimization
2023, European Journal of Operational ResearchA branch-and-price-and-cut for the manpower allocation and vehicle routing problem with staff qualifications and time windows
2023, Advanced Engineering InformaticsNew pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems
2023, European Journal of Operational ResearchCitation Excerpt :It is applied at each node of the enumeration tree. The third heuristic, called diving, is a depth-first heuristic search in the branch-and-price (BP) tree based on the heuristic solution framework proposed by Joncour, Michel, Sadykov, Sverdlov, & Vanderbeck (2010). In the following, we provide a detailed description of the primal and the diving heuristic.
Copyright © 2010 Elsevier B.V. All rights reserved.