A branch-and-cut algorithm for the Undirected Rural Postman Problem

被引：64

作者：

Ghiani, G ^{[1
]}

Laporte, G ^{[1
]}

机构：

[1] Ecole Hautes Etud Commerciales, Gerad, Montreal, PQ H3T 2A7, Canada

来源：

MATHEMATICAL PROGRAMMING | 2000年 / 87卷 / 03期

关键词：

Arc Routing Problems; Undirected Rural Postman Problem; branch-and-cut; polyhedral analysis; facets;

D O I：

10.1007/s101070050007

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

The well-known Undirected Rural Postman Problem is considered and a binary linear problem using new dominance relations is presented. Polyhedral properties are investigated and a branch-and-cut algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.

引用

页码：467 / 481

页数：15

共 50 条

[31] A branch-and-cut algorithm for the Steiner tree problem with delays
Leggieri, V.
Haouari, M.
Triki, C.
[J]. OPTIMIZATION LETTERS, 2012, 6 (08) : 1753 - 1771
[32] A branch-and-cut algorithm for the Orienteering Arc Routing Problem
Archetti, Claudia
Corberan, Angel
Plana, Isaac
Sanchis, Jose M.
Grazia Speranza, M.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 66 : 95 - 104
[33] A Branch-and-Cut algorithm for factory crane scheduling problem
Cheng, Xu
Tang, Lixin
Pardalos, Panos M.
[J]. JOURNAL OF GLOBAL OPTIMIZATION, 2015, 63 (04) : 729 - 755
[34] A branch-and-cut algorithm for the balanced traveling salesman problem
Vo, Thi Quynh Trang
Baiou, Mourad
Nguyen, Viet Hung
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (02)
[35] A branch-and-cut algorithm for the capacitated profitable tour problem
Jepsen, Mads Kehlet
Petersen, Bjorn
Spoorendonk, Simon
Pisinger, David
[J]. DISCRETE OPTIMIZATION, 2014, 14 : 78 - 96
[36] A branch-and-cut algorithm for the ring spur assignment problem
Carroll, Paula
Fortz, Bernard
Labbe, Martine
McGarraghy, Sean
[J]. NETWORKS, 2013, 61 (02) : 89 - 103
[37] A branch-and-cut algorithm for the median-path problem
Avella, P
Boccia, M
Sforza, A
Vasil'ev, I
[J]. COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2005, 32 (03) : 215 - 230
[38] A branch-and-cut algorithm for the vehicle routing problem with drones
Tamke, Felix
Buscher, Udo
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2021, 144 : 174 - 203
[39] A branch-and-cut algorithm for the Steiner tree problem with delays
V. Leggieri
M. Haouari
C. Triki
[J]. Optimization Letters, 2012, 6 : 1753 - 1771
[40] A branch-and-cut algorithm for the hub location and routing problem
Rodriguez-Martin, Inmaculada
Salazar-Gonzalez, Juan-Jose
Yaman, Hande
[J]. COMPUTERS & OPERATIONS RESEARCH, 2014, 50 : 161 - 174

← 1 2 3 4 5 →