A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
From MaRDI portal
Publication:4018534
DOI10.1057/jors.1992.73zbMath0773.90024MaRDI QIDQ4018534
Gilbert Laporte, Hélène Mercure, Yves Nobert
Publication date: 16 January 1993
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1992.73
90C35: Programming involving graphs or networks
90C10: Integer programming
90B06: Transportation, logistics and supply chain management
90C09: Boolean programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Branch and cut methods for network optimization, A new subtour elimination constraint for the vehicle routing problem, Routing problems: A bibliography