A cutting plane algorithm for the General Routing Problem

被引：0
|
作者：
Angel Corberáan
Adam N. Letchford
José María Sanchis
机构：
[1] DEIO,
[2] Faculty of Mathematics,undefined
[3] University of Valencia,undefined
[4] Spain,undefined
[5] Dept. of Management Science,undefined
[6] Lancaster University,undefined
[7] England,undefined
[8] Dept. of Applied Mathematics,undefined
[9] University Polytechnic of Valencia,undefined
[10] Spain,undefined
来源：
Mathematical Programming | 2001年 / 90卷
关键词：
Key words: valid inequalities – cutting planes – General Routing Problem – Rural Postman Problem – Graphical Travelling Salesman Problem; Mathematics Subject Classification (2000): 90C57;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
The General Routing Problem (GRP) is the problem of finding a minimum cost route for a single vehicle, subject to the condition that the vehicle visits certain vertices and edges of a network. It contains the Rural Postman Problem, Chinese Postman Problem and Graphical Travelling Salesman Problem as special cases. We describe a cutting plane algorithm for the GRP based on facet-inducing inequalities and show that it is capable of providing very strong lower bounds and, in most cases, optimal solutions.
引用
收藏
页码：291 / 316
页数：25
相关论文
共 50 条
12345