A cutting plane algorithm for the General Routing Problem

Saved in:
Bibliographic Details
Published inMathematical programming Vol. 90; no. 2; pp. 291 - 316
Main Authors Corberáan, Angel, Letchford, Adam N., Sanchis, José María
Format Journal Article
LanguageEnglish
Published Heidelberg Springer 01.04.2001
Subjects
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Operational research and scientific management
Operational research. Management science
Lower bound
Vehicle routing problem
Optimal solution
Travelling salesman problem
Routing
Cutting plane method
Chinese postman problem
Inequality
Online AccessGet full text
ISSN0025-5610
1436-4646
DOI10.1007/PL00011426

Cover

More Information
ISSN:0025-5610
1436-4646
DOI:10.1007/PL00011426