A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems

DOI10.1057/JORS.1992.73zbMath0773.90024OpenAlexW2023095752MaRDI QIDQ4018534

Hélène Mercure, Gilbert Laporte, 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

zbMATH Keywords

branch and boundtravelling salesmanasymmetrical vehicle routeing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Routing problems: A bibliography ⋮ Branch and cut methods for network optimization ⋮ A new subtour elimination constraint for the vehicle routing problem

This page was built for publication: A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems