IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i8p1399-1412.html
   My bibliography  Save this article

An algorithm and upper bounds for the weighted maximal planar graph problem

Author

Listed:
  • Amir Ahmadi-Javid

    (Amirkabir University of Technology, Tehran, Iran)

  • Amir Ardestani-Jaafari

    (GERAD, HEC Montréal, Montréal, Canada)

  • Leslie R Foulds

    (Instituto de Informática, Universidade Federal de Goiás, Goiania, Brasil)

  • Hossein Hojabri

    (CIRRELT and Départment d’informatique et de recherche opérationnelle, Université de Montréal, Montréal, Canada)

  • Reza Zanjirani Farahani

    (Kingston University, London, UK)

Abstract

In this paper, we investigate the weighted maximal planar graph (WMPG) problem. Given a complete, edge-weighted, simple graph, the WMPG problem involves finding a subgraph with the highest sum of edge weights that is maximal planar, namely, it can be embedded in the plane without any of its edges intersecting, and no additional edge can be added to the subgraph without violating its planarity. We present a new integer linear programming (ILP) model for this problem. We then develop a cutting-plane algorithm to solve the WMPG problem based on the proposed ILP model. This algorithm enables the problem to be solved more efficiently than previously reported algorithms. New upper bounds are also provided, which are useful in evaluating the quality of heuristic solutions or in generating initial solutions for meta-heuristics. Computational results are reported for a set of 417 test instances of size varying from 6 to 100 nodes including 105 instances from the literature and 312 randomly generated instances. The computational results indicate that instances with up to 24 nodes can be solved optimally in reasonable computational time and the new upper bounds for larger instances significantly improve existing upper bounds.

Suggested Citation

  • Amir Ahmadi-Javid & Amir Ardestani-Jaafari & Leslie R Foulds & Hossein Hojabri & Reza Zanjirani Farahani, 2015. "An algorithm and upper bounds for the weighted maximal planar graph problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(8), pages 1399-1412, August.
    • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:8:p:1399-1412
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n8/pdf/jors201498a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v66/n8/full/jors201498a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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. Amir Ahmadi-Javid & Nasrin Ramshe, 2019. "Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm," 4OR, Springer, vol. 17(4), pages 373-400, 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:pal:jorsoc:v:66:y:2015:i:8:p:1399-1412. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.