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 条
  • [1] A branch-and-cut algorithm for the Undirected Rural Postman Problem
    Ghiani, G
    Laporte, G
    [J]. MATHEMATICAL PROGRAMMING, 2000, 87 (03) : 467 - 481
  • [2] A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem
    Fernandez, Elena
    Laporte, Gilbert
    Rodriguez-Pereira, Jessica
    [J]. TRANSPORTATION SCIENCE, 2018, 52 (02) : 353 - 369
  • [3] A branch-and-cut algorithm for the profitable windy rural postman problem
    Avila, Thais
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (03) : 1092 - 1101
  • [4] A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem
    Avila, Thais
    Corberan, Angel
    Plana, Isaac
    Sanchis, Jose M.
    [J]. TRANSPORTATION SCIENCE, 2016, 50 (02) : 750 - 761
  • [5] A branch-and-cut algorithm for the windy profitable location rural postman problem
    Khorramizadeh, Mostafa
    Javvi, Roghayeh
    [J]. ANNALS OF OPERATIONS RESEARCH, 2024,
  • [6] The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
    Colombi, Marco
    Corberan, Angel
    Mansini, Renata
    Plana, Isaac
    Sanchis, Jose M.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (01) : 1 - 12
  • [7] A branch-and-cut algorithm for the undirected traveling purchaser problem
    Laporte, G
    Riera-Ledesma, J
    Salazar-González, JJ
    [J]. OPERATIONS RESEARCH, 2003, 51 (06) : 940 - 951
  • [8] A branch-and-cut algorithm for the maximum benefit Chinese postman problem
    Ángel Corberán
    Isaac Plana
    Antonio M. Rodríguez-Chía
    José M. Sanchis
    [J]. Mathematical Programming, 2013, 141 : 21 - 48
  • [9] A branch-and-cut algorithm for the maximum benefit Chinese postman problem
    Corberan, Angel
    Plana, Isaac
    Rodriguez-Chia, Antonio M.
    Sanchis, Jose M.
    [J]. MATHEMATICAL PROGRAMMING, 2013, 141 (1-2) : 21 - 48
  • [10] A branch-and-cut algorithm for the undirected selective traveling salesman problem
    Gendreau, M
    Laporte, G
    Semet, F
    [J]. NETWORKS, 1998, 32 (04) : 263 - 273
12345