Skip to main content
Springer Nature Link
Log in

A note on the Undirected Rural Postman Problem polytope

  • Published:
Mathematical Programming Submit manuscript

Abstract

This note refers to the article by G. Ghiani and G. Laporte ``A branch-and-cut algorithm for the Undirected Rural Postman Problem'', Math. Program. 87 (2000). We show that some conditions for the facet-defining property of the basic non-trivial inequalities are not sufficient and that the Rural Postman Problem polytope is more complex even when focusing on canonical inequalities only.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Catlin, P.A.: Supereulerian Graphs: A Survey. J. Graph Theory 16 (2), 177–196 (1992)

    MathSciNet  Google Scholar 

  2. Christofides, N., Campos, V., Corberá, A., Mota, E.: An algorithm for the Rural Postman Problem. Technical report, Imperial College London, 1981

  3. Ghiani, G., Laporte, G.: A branch-and-cut algorithm for the Undirected Rural Postman Problem. Math. Program. Ser. A 87 (3), 467–481 (2000)

    Article  MathSciNet  Google Scholar 

  4. Lenstra, J.K., Rinnooy Kan, A.H.G.: On general routing problems. Networks 6, 273–280 (1976)

    MATH  MathSciNet  Google Scholar 

  5. Letchford, A.N.: New inequalities for the General Routing Problem. Eur. J. Oper. Res. 96, 317–322 (1996)

    Article  Google Scholar 

  6. Reinelt, G., Theis, D.O.: On the General Routing polytope. To appear in Special Issue of Discrete Appl. Math. ``Combinatorial Optimisation 2004''

  7. Reinelt, G., Theis, D.O.: Transformation of facets of the General Routing Problem polytope. To appear in SIAM J. Optim. 2005

  8. Richey, M., Parker, R., Rardin, R.: On Finding Spanning Eulerian Subgraphs. Nav. Res. Logist. Quaterly 32, 443–455 (1985)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Heidelberg, Germany

    Gerhard Reinelt & Dirk Oliver Theis

Authors
  1. Gerhard Reinelt
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Dirk Oliver Theis
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Dirk Oliver Theis.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Reinelt, G., Theis, D. A note on the Undirected Rural Postman Problem polytope. Math. Program. 106, 447–452 (2006). https://doi.org/10.1007/s10107-005-0640-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-005-0640-1

Mathematics Subject Classification (2000)