IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p295-31910.1023-a1018963020368.html
   My bibliography  Save this article

Minimal cost linkages in graphs

Author

Listed:
  • S.A. Harrison
  • V.J. Rayward‐Smith

Abstract

In this paper, we consider the problem of finding minimal cost linkages in graphs. Wediscuss how this problem arises in practice and, in particular, its relevance to the military.Given a graph G with an associated cost function and a multiset of vertex pairs, weaddress the problem of finding a linkage of minimal cost. From this optimisation problem,we are able to define the decision problems Min‐Sum Non‐Intersecting Paths (MSNP) andMin‐Max Non‐Intersecting Paths (MMNP), and prove their NP‐completeness. We also showthat for fixed k >= 2, where k denotes the number of terminal pairs, MMNP remains NP‐complete.We also define restricted versions of the problems, MMNP(r) and MSNP(r), where link-agesmay only be defined over the r cheapest paths between each vertex pair. For fixedk >= 3, we show the restricted problems remain NP‐complete and discuss the limitations ofthe restriction.We include a case study which demonstrates the advantages of using heuristic methods,such as genetic algorithms and simulated annealing, to find solutions to the optimisationproblem MSNP(r). Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • S.A. Harrison & V.J. Rayward‐Smith, 1999. "Minimal cost linkages in graphs," Annals of Operations Research, Springer, vol. 86(0), pages 295-319, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:295-319:10.1023/a:1018963020368
    DOI: 10.1023/A:1018963020368
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018963020368
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018963020368?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.

    Citations

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


    Cited by:

    1. Marvin L. King & David R. Galbreath & Alexandra M. Newman & Amanda S. Hering, 2020. "Combining regression and mixed-integer programming to model counterinsurgency," Annals of Operations Research, Springer, vol. 292(1), pages 287-320, September.
    2. Ram Gopalan, 2015. "Computational complexity of convoy movement planning problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 31-60, August.

    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:spr:annopr:v:86:y:1999:i:0:p:295-319:10.1023/a:1018963020368. 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.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.