Abstract
The linear ordering problem consists of finding an ordering of the nodes of the weighted complete digraph on n nodes such that the sum of the weights of the arcs compatible with the ordering is maximized. In this paper, we report about the usefulness of mod-k cuts in a branch-and-cut algorithm for solving linear ordering problems to optimality.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Andrello A, Caprara A, Fischetti M (2007) Embedding {0,1/2}-cuts in a branch and cut framework: a computational study. Inf J Comput 19(2):229–238
Bolotashvili G, Kovalev M, Girlich E (1999) New facets of the linear ordering polytope. SIAM J Discrete Math 12:326–336
Caprara A, Fischetti M (1996) \(\{0,\frac{1}{2}\}\) -Chvátal–Gomory cuts. Math Program 74:221–235
Caprara A, Fischetti M, Letchford AN (2000) On the separation of maximally violated mod-k cuts. Math Program 87:37–56
Doignon J-P, Fiorini S, Joret G (2006) Facets of the linear ordering polytope: a unification for the fence family through weighted graphs. J Math Psychol 50:251–262
Fiorini S (2001) Determining the automorphism group of the linear ordering polytope. Discrete Appl Math 112:121–128
Fricke L (2007) Maximally violated mod-k cuts: a general purpose separation routine and its application to the linear ordering problem. Diploma thesis, University of Heidelberg
Grötschel M, Jünger M, Reinelt G (1984) A cutting plane algorithm for the linear ordering problem. Oper Res 32:1195–1220
Grötschel M, Jünger M, Reinelt G (1985) Facets of the linear ordering polytope. Math Program 33:43–60
Ilog Cplex (2009) http://www.ilog.com/products/cplex
Jünger M, Thienel S (2000) The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Softw Pract Exp 30:1325–1352. http://www.informatik.uni-koeln.de/abacus
Leung J, Lee J (1994) More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl Math 50:185–200
LOLIB (2008) A library of linear ordering benchmark instances. http://www.informatik.uni-heidelberg.de/groups/comopt/software/LOLIB
McLennan A (1990) Binary stochastic choice. In: Chipman J, McFadden D, Richter M (eds) Preferences, uncertainty and rationality. Westview Press, Boulder, pp 187–202
Reinelt G (1985) The linear ordering problem: algorithms and applications. Research and exposition in mathematics, vol 8. Heldermann
Reinelt G (1995) A note on small linear ordering polytopes. Discrete Comput Geom 10:67–78
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Oswald, M., Reinelt, G. & Seitz, H. Applying mod-k-cuts for solving linear ordering problems. TOP 17, 158–170 (2009). https://doi.org/10.1007/s11750-009-0096-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-009-0096-1