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.
Similar content being viewed by others
References
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)
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)
Cacchiani V., Caprara A., Toth P.: Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 38, 179–184 (2010)
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)
Author information
Authors and Affiliations
Corresponding author
Rights 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
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-011-0416-x