A note on ``A LP-based heuristic for a time-constrained routing problem

DOI10.1016/j.ejor.2012.03.048zbMath1253.90138OpenAlexW2053213682MaRDI QIDQ1926858

Ş. İlker Birbil, Kerem Bülbül, Güvenç Şahin, Ịbrahim Muter

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2012.03.048

zbMATH Keywords

column generationlarge-scale optimizationcolumn-and-row generationtime-constrained routing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items (5)

Solution methods for the tray optimization problem ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ An ILP-based local search procedure for the VRP with pickups and deliveries ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Algorithms for the one-dimensional two-stage cutting stock problem

Cites Work

• A stabilized structured Dantzig-Wolfe decomposition method
• A generalization of column generation to accelerate convergence
• 0-1 reformulations of the multicommodity capacitated network design problem
• Modeling multistage cutting stock problems
• Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
• A LP-based heuristic for a time-constrained routing problem
• A generic view of Dantzig--Wolfe decomposition in mixed integer programming

This page was built for publication: A note on ``A LP-based heuristic for a time-constrained routing problem