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 条

[31] A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem
Avella, Pasquale
Boccia, Maurizio
Vasilyev, Igor
[J]. IEEE ACCESS, 2013, 1 : 475 - 479
[32] 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
[33] A Branch-and-Cut Algorithm for the Median-Path Problem
Pasquale Avella
Maurizio Boccia
Antonio Sforza
Igor Vasil'Ev
[J]. Computational Optimization and Applications, 2005, 32 : 215 - 230
[34] 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
[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 balanced traveling salesman problem
Vo, Thi Quynh Trang
Baiou, Mourad
Nguyen, Viet Hung
[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (02)
[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 ring spur assignment problem
Carroll, Paula
Fortz, Bernard
Labbe, Martine
McGarraghy, Sean
[J]. NETWORKS, 2013, 61 (02) : 89 - 103
[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 →