A note on ``A LP-based heuristic for a time-constrained routing problem''
type: Item
instance of: scholarly article
title: A note on ``A LP-based heuristic for a time-constrained routing problem''
zbMATH Open document ID: 1253.90138
author: Ş. İlker Birbil
author: Kerem Bülbül
author: Güvenç Şahin
author: İbrahim Muter
published in: European Journal of Operational Research
publication date: 2012-12-29T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6119448
zbMATH Keywords: large-scale optimization
zbMATH Keywords: column generation
zbMATH Keywords: column-and-row generation
zbMATH Keywords: time-constrained routing
MaRDI profile type: Publication
full work available at URL: j.ejor.2012.03.048
OpenAlex ID: W2053213682
cites work: A LP-based heuristic for a time-constrained routing problem
cites work: 0-1 reformulations of the multicommodity capacitated network design problem
cites work: A stabilized structured Dantzig-Wolfe decomposition method
cites work: A generalization of column generation to accelerate convergence
cites work: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
cites work: A generic view of Dantzig--Wolfe decomposition in mixed integer programming
cites work: Modeling multistage cutting stock problems
DOI: 10.1016/J.EJOR.2012.03.048
description: scientific article; zbMATH DE number 6119448