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

被引：0

作者：

Gianpaolo Ghiani

Gilbert Laporte

机构：

[1] GERAD,

[2] École des Hautes Études Commerciales,undefined

[3] 3000 chemin de la Côte-Sainte-Catherine,undefined

[4] Montréal,undefined

[5] Canada H3T 2A7,undefined

[6] e-mail: {ghiani,undefined

[7] gilbert}@crt.umontreal.ca,undefined

来源：

Mathematical Programming | 2000年 / 87卷

关键词：

Key words: Arc Routing Problems – Undirected Rural Postman Problem – branch-and-cut – polyhedral analysis – facets; Mathematics Subject Classification (1991): 05c45;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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

页数：14

共 50 条

[41] A Branch-and-Cut algorithm for factory crane scheduling problem
Xu Cheng
Lixin Tang
Panos M. Pardalos
[J]. Journal of Global Optimization, 2015, 63 : 729 - 755
[42] 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
[43] A branch-and-cut algorithm for the balanced traveling salesman problem
Thi Quynh Trang Vo
Mourad Baiou
Viet Hung Nguyen
[J]. Journal of Combinatorial Optimization, 2024, 47
[44] New Facets and an Enhanced Branch-and-Cut for the Min-Max K-Vehicles Windy Rural Postman Problem
Benavent, Enrique
Corberan, Angel
Plana, Isaac
Sanchis, Jose M.
[J]. NETWORKS, 2011, 58 (04) : 255 - 272
[45] A note on the undirected rural postman problem polytope
Reinelt, G
Theis, DO
[J]. MATHEMATICAL PROGRAMMING, 2006, 106 (03) : 447 - 452
[46] A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Silvestri, Selene
Laporte, Gilbert
Cerulli, Raffaele
[J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 81 : 322 - 332
[47] Improvement procedures for the undirected rural postman problem
Hertz, A
Laporte, G
Hugo, PN
[J]. INFORMS JOURNAL ON COMPUTING, 1999, 11 (01) : 53 - 62
[48] A note on the Undirected Rural Postman Problem polytope
Gerhard Reinelt
Dirk Oliver Theis
[J]. Mathematical Programming, 2006, 106 : 447 - 452
[49] A constructive heuristic for the undirected rural postman problem
Ghiani, G
Laganà, D
Musmanno, R
[J]. COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3450 - 3457
[50] A branch-and-cut algorithm for a realistic dial-a-ride problem
Liu, Mengyang
Luo, Zhixing
Lim, Andrew
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2015, 81 : 267 - 288

← 1 2 3 4 5 →