IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v79y1994i1p95-114.html
   My bibliography  Save this article

A polyhedral approach to the rural postman problem

Author

Listed:
  • Corberan, A.
  • Sanchis, J. M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Corberan, A. & Sanchis, J. M., 1994. "A polyhedral approach to the rural postman problem," European Journal of Operational Research, Elsevier, vol. 79(1), pages 95-114, November.
    • Handle: RePEc:eee:ejores:v:79:y:1994:i:1:p:95-114
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)90398-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kasaei, Maziar & Salman, F. Sibel, 2016. "Arc routing problems to restore connectivity of a road network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 95(C), pages 177-206.
    2. Sahin, Halenur & Kara, Bahar Yetis & Karasan, Oya Ekin, 2016. "Debris removal during disaster response: A case for Turkey," Socio-Economic Planning Sciences, Elsevier, vol. 53(C), pages 49-59.
    3. Benavent, Enrique & Carrotta, Alessandro & Corberan, Angel & Sanchis, Jose M. & Vigo, Daniele, 2007. "Lower bounds and heuristics for the Windy Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 855-869, January.
    4. Ávila, Thais & Corberán, Ángel & Plana, Isaac & Sanchis, José M., 2016. "A branch-and-cut algorithm for the profitable windy rural postman problem," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1092-1101.
    5. Angel Corberán & Gustavo Mejía & José M. Sanchis, 2005. "New Results on the Mixed General Routing Problem," Operations Research, INFORMS, vol. 53(2), pages 363-376, April.
    6. Letchford, Adam N., 1999. "The general routing polyhedron: A unifying framework," European Journal of Operational Research, Elsevier, vol. 112(1), pages 122-133, January.
    7. Corberan, A. & Sanchis, J. M., 1998. "The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra," European Journal of Operational Research, Elsevier, vol. 108(3), pages 538-550, August.
    8. Benavent, Enrique & Corberán, Ángel & Laganà, Demetrio & Vocaturo, Francesca, 2019. "The periodic rural postman problem with irregular services on mixed graphs," European Journal of Operational Research, Elsevier, vol. 276(3), pages 826-839.
    9. Julián Aráoz & Elena Fernández & Carles Franquesa, 2017. "The Generalized Arc Routing Problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(3), pages 497-525, October.
    10. Alain Hertz & Gilbert Laporte & Pierrette Nanchen Hugo, 1999. "Improvement Procedures for the Undirected Rural Postman Problem," INFORMS Journal on Computing, INFORMS, vol. 11(1), pages 53-62, February.
    11. Arbib, Claudio & Servilio, Mara & Archetti, Claudia & Speranza, M. Grazia, 2014. "The directed profitable location Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 236(3), pages 811-819.
    12. Letchford, A.N. & Eglese, R.W., 1998. "The rural postman problem with deadline classes," European Journal of Operational Research, Elsevier, vol. 105(3), pages 390-400, March.
    13. Elena Fernández & Oscar Meza & Robert Garfinkel & Maruja Ortega, 2003. "On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation," Operations Research, INFORMS, vol. 51(2), pages 281-291, April.
    14. Barbara De Rosa & Gennaro Improta & Gianpaolo Ghiani & Roberto Musmanno, 2002. "The Arc Routing and Scheduling Problem with Transshipment," Transportation Science, INFORMS, vol. 36(3), pages 301-313, August.
    15. Letchford, Adam N., 1997. "New inequalities for the General Routing Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 317-322, January.
    16. Cabral, Edgar Alberto & Gendreau, Michel & Ghiani, Gianpaolo & Laporte, Gilbert, 2004. "Solving the hierarchical Chinese postman problem as a rural postman problem," European Journal of Operational Research, Elsevier, vol. 155(1), pages 44-50, May.
    17. Elena Fernández & Gilbert Laporte & Jessica Rodríguez-Pereira, 2018. "A Branch-and-Cut Algorithm for the Multidepot Rural Postman Problem," Transportation Science, INFORMS, vol. 52(2), pages 353-369, March.
    18. Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis, 2016. "A New Branch-and-Cut Algorithm for the Generalized Directed Rural Postman Problem," Transportation Science, INFORMS, vol. 50(2), pages 750-761, May.
    19. Aráoz, Julián & Fernández, Elena & Meza, Oscar, 2009. "Solving the Prize-collecting Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 196(3), pages 886-896, August.
    20. Elena Fernández & Gilbert Laporte & Jessica Rodríguez-Pereira, 2019. "Exact Solution of Several Families of Location-Arc Routing Problems," Transportation Science, INFORMS, vol. 53(5), pages 1313-1333, September.
    21. Elena Fernández & Jessica Rodríguez-Pereira, 2017. "Multi-depot rural postman problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(2), pages 340-372, July.
    22. Julián Aráoz & Elena Fernández & Carles Franquesa, 2009. "The Clustered Prize-Collecting Arc Routing Problem," Transportation Science, INFORMS, vol. 43(3), pages 287-300, August.
    23. Corberán, Ángel & Plana, Isaac & Reula, Miguel & Sanchis, José M., 2021. "On the Distance-Constrained Close Enough Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 291(1), pages 32-51.
    24. Ángel Corberán & Elena Fernández & Carles Franquesa & José María Sanchis, 2011. "The Windy Clustered Prize-Collecting Arc-Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 317-334, August.
    25. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:79:y:1994:i:1:p:95-114. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.