Exact algorithms for the quadratic linear ordering problem

INFORMS Journal on Computing

Volumn 22, Issue 1, 2010, Pages 168-177

  Buchheim, Christoph ^a   Wiegele, Angelika ^b   Zheng, Lanbo ^c  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF KLAGENFURT   (Austria)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

Crossing minimization; Linear ordering; Quadratic optimization

Indexed keywords

EID: 77949368432     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0318     Document Type: Article

References (14)

1. Barahona, F., A. R. Mahjoub. 1986. On the cut polytope. Math. Programming 36(2) 157-173.
2. Billionnet, A., S. Elloumi. 2007. Using a mixed integer quadratic programming solver for the unconstrained quadratic 0-1 problem. Math. Programming 109(1) 55-68.
3. De Simone, C. 1990. The cut polytope and the Boolean quadric polytope. Discrete Math. 79(1) 71-75.
4. Eades, P., N. C. Wormald. 1994. Edge crossings in drawing bipartite graphs. Algorithmica 11 379-403.
5. Garey, M. R., D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York.
6. Grötschel, M., M. Jünger, G. Reinelt. 1985. Facets of the linear ordering polytope. Math. Programming 33(1) 43-60.
7. Jünger, M., P. Mutzel. 1997. 2-layer straightline crossing minimization: Performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1(1) 1-25.
8. Knuth, D. 1993. The Stanford GraphBase: A Platform for Combinatorial Computing. ACM Press, Addison-Wesley Publishing Company, New York.
9. Laurent, M. 1997. The max-cut problem. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliography in Combinatorial Optimization. John Wiley & Sons, New York, 247-249.
10. Lewis, M., B. Alidaee, F. Glover, G. Kochenberger. 2009. A note on xQx as a modeling and solution framework for the linear ordering problem. Internat. J. Oper. Res. 5(2) 152-162.
11. Liers, F., M. Jünger, G. Reinelt, G. Rinaldi. 2004. Computing exact ground states of hard Ising spin glass problems by branch-and-cut. A. K. Hartmann, H. Rieger, eds. New Optimization Algorithms in Physics. Wiley-VCH, Weinheim, Germany, 47-69.
12. Reinelt, G. 1985. The Linear Ordering Problem: Algorithms and Applications. Heldermann Verlag, Lemgo, Germany.
13. Rendl, F., G. Rinaldi, A. Wiegele. 2007. A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations. Integer Programming and Combinatorial Optimization-IPCO 2007, Lecture Notes in Computer Science, Vol. 4513. Springer, Berlin, 295-309.
14. Zheng, L., C. Buchheim. 2007. A new exact algorithm for the twosided crossing minimization problem.A.Dress, Y.Xu, B.Zhu, eds. Combinatorial Optimization and Applications-COCOA 2007, Lecture Notes in Computer Science, Vol. 4616. Springer, Berlin, 301-310.