IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v51y2012i3p1211-1229.html
   My bibliography  Save this article

A combinatorial optimization algorithm for solving the branchwidth problem

Author

Listed:
  • J. Smith
  • Elif Ulusal
  • Illya Hicks

Abstract

No abstract is available for this item.

Suggested Citation

  • J. Smith & Elif Ulusal & Illya Hicks, 2012. "A combinatorial optimization algorithm for solving the branchwidth problem," Computational Optimization and Applications, Springer, vol. 51(3), pages 1211-1229, April.
  • Handle: RePEc:spr:coopap:v:51:y:2012:i:3:p:1211-1229
    DOI: 10.1007/s10589-011-9397-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-011-9397-z
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10589-011-9397-z?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. William Cook & Paul Seymour, 2003. "Tour Merging via Branch-Decomposition," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 233-248, August.
    2. Illya V. Hicks, 2005. "Planar Branch Decompositions II: The Cycle Method," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 413-421, November.
    Full references (including those not matched with items on IDEAS)

    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. Illya V. Hicks, 2005. "Planar Branch Decompositions I: The Ratcatcher," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 402-412, November.
    2. Cambazard, Hadrien & Catusse, Nicolas, 2018. "Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane," European Journal of Operational Research, Elsevier, vol. 270(2), pages 419-429.
    3. Taillard, Éric D. & Helsgaun, Keld, 2019. "POPMUSIC for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 272(2), pages 420-429.
    4. W. David Pisinger & Anders Bo Rasmussen & Rune Sandvik, 2007. "Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction," INFORMS Journal on Computing, INFORMS, vol. 19(2), pages 280-290, May.
    5. Weiqi Li, 2011. "Seeking global edges for traveling salesman problem in multi-start search," Journal of Global Optimization, Springer, vol. 51(3), pages 515-540, November.
    6. Illya V. Hicks, 2005. "Planar Branch Decompositions II: The Cycle Method," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 413-421, November.
    7. El-Ghazali Talbi, 2016. "Combining metaheuristics with mathematical programming, constraint programming and machine learning," Annals of Operations Research, Springer, vol. 240(1), pages 171-215, May.
    8. Blum, Christian & Ochoa, Gabriela, 2021. "A comparative analysis of two matheuristics by means of merged local optima networks," European Journal of Operational Research, Elsevier, vol. 290(1), pages 36-56.
    9. Yuichi Nagata & Shigenobu Kobayashi, 2013. "A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 346-363, May.
    10. Caleb C. Fast & Illya V. Hicks, 2017. "A Branch Decomposition Algorithm for the p -Median Problem," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 474-488, August.
    11. S. Margulies & J. Ma & I. V. Hicks, 2013. "The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 25(4), pages 599-610, November.

    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:spr:coopap:v:51:y:2012:i:3:p:1211-1229. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.