Skip to main content
SpringerLink
Log in

Finding cliques of maximum weight on a generalization of permutation graphs

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

We propose a dynamic programming procedure for computing the clique of maximum weight on a class of graphs arising in the solution of train timetabling problems. These graphs generalize, in two ways permutation graphs, defined as the intersection graphs of segments joining two parallel lines. First, two segments are joined by an edge not only if they intersect but also if their endpoints are sufficiently close. Second, two parallel segments may be joined by an edge even if they are arbitrarily far away from each other.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: The maximum clique problem. In: Du, D.-Z., Pardalos, P.M. (eds) Handbook of combinatorial optimization, pp. 1–74. Kluwer Academic Publishers, Boston (1999)

    Google Scholar 

  2. Brännlund U., Lindberg P.O., Nöu A., Nilsson J.E.: Allocation of scarce track capacity using Lagrangian relaxation. Transp. Sci. 32, 358–369 (1998)

    Article  MATH  Google Scholar 

  3. Cacchiani V., Caprara A., Toth P.: Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38, 179–184 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  4. Golumbic, M.C.: Algorithmic graph theory and perfect graphs (2nd edn.). In: Annals of Discrete Mathematics, vol 57. Nort Holland Publishing, Amsterdam, The Netherlands (2004)

Download references

Author information

Authors and Affiliations

  1. DEIS, University of Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

    Valentina Cacchiani, Alberto Caprara & Paolo Toth

Authors
  1. Valentina Cacchiani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alberto Caprara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paolo Toth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alberto Caprara.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cacchiani, V., Caprara, A. & Toth, P. Finding cliques of maximum weight on a generalization of permutation graphs. Optim Lett 7, 289–296 (2013). https://doi.org/10.1007/s11590-011-0416-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-011-0416-x

Keywords

Search

Navigation