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

The Steiner cycle polytope

Author

Listed:
  • Salazar-Gonzalez, Juan-Jose

Abstract

No abstract is available for this item.

Suggested Citation

  • Salazar-Gonzalez, Juan-Jose, 2003. "The Steiner cycle polytope," European Journal of Operational Research, Elsevier, vol. 147(3), pages 671-679, June.
    • Handle: RePEc:eee:ejores:v:147:y:2003:i:3:p:671-679
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(02)00359-4
    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.

    References listed on IDEAS

    as
    1. Petra Bauer, 1997. "The Circuit Polytope: Facets," Mathematics of Operations Research, INFORMS, vol. 22(1), pages 110-145, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Ante Ćustić & Stefan Lendl, 2022. "The Steiner cycle and path cover problem on interval graphs," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 226-234, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Müller, R.J. & Gui, H. & Vohra, R., 2004. "Dominant strategy mechanisms with multidimensional types," Research Memorandum 046, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    2. Kobeaga, Gorka & Rojas-Delgado, Jairo & Merino, María & Lozano, Jose A., 2024. "A revisited branch-and-cut algorithm for large-scale orienteering problems," European Journal of Operational Research, Elsevier, vol. 313(1), pages 44-68.
    3. Vicky Mak & Tommy Thomadsen, 2006. "Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem," Journal of Combinatorial Optimization, Springer, vol. 11(4), pages 421-434, June.
    4. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    5. Nguyen, Viet Hung & Maurras, Jean-Francois, 2002. "On the linear description of the 3-cycle polytope," European Journal of Operational Research, Elsevier, vol. 137(2), pages 310-325, March.
    6. Gorka Kobeaga & María Merino & Jose A. Lozano, 2021. "On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms," Annals of Operations Research, Springer, vol. 305(1), pages 107-136, October.
    7. J Renaud & F F Boctor & G Laporte, 2004. "Efficient heuristics for Median Cycle Problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 179-186, February.
    8. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    9. Labbe, Martine & Laporte, Gilbert & Rodriguez Martin, Inmaculada & Gonzalez, Juan Jose Salazar, 2005. "Locating median cycles in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 457-470, January.
    10. Dilson Lucas Pereira & Abilio Lucena & Alexandre Salles da Cunha & Luidi Simonetti, 2022. "Exact Solution Algorithms for the Chordless Cycle Problem," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1970-1986, July.

    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:147:y:2003:i:3:p:671-679. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.