Semidefinite relaxations of ordering problems

Mathematical Programming

Volumn 140, Issue 1, 2013, Pages 77-97

  Hungerlander P ^a   Rendl, F ^a  

^a UNIVERSITY OF KLAGENFURT   (Austria)

Author keywords

Mathematics Subject Classification: 90C22

Indexed keywords

EXACT SOLUTION; LINEAR ORDERING PROBLEMS; SEMIDEFINITE OPTIMIZATION; SEMIDEFINITE RELAXATION; SUBJECT CLASSIFICATION; SYSTEMATIC INVESTIGATIONS;

CLASSIFICATION (OF INFORMATION);

PROFITABILITY;

EID: 84879793281     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-012-0627-7     Document Type: Article

References (44)

1. Achatz, H.; Kleinschmidt, P.; Lambsdorff, J.: Der corruption perceptions index und das linear ordering problem. ORNews 26, 10-12 (2006)
2. Amaral, A.R.S.: A new lower bound for the single row facility layout problem. Discrete Appl. Math. 157(1), 183-190 (2009)
3. Amaral, A.R.S.; Letchford, A.N.: A polyhedral approach to the single row facility layout problem (in preparation). Preprint available from http://www.optimization-online.org/DB-FILE/2008/03/1931.pdf (2011)
4. Anjos, M.F.; Kennings, A.; Vannelli, A.: A semidefinite optimization approach for the single-row layout problem with unequal dimensions. Discrete Optim. 2(2), 113-122 (2005)
5. Anjos, M.F.; Vannelli, A.: Computing globally optimal solutions for single-row layout problems using semidefinite programming and cutting planes. INFORMS J. Comput. 20(4), 611-617 (2008)
6. Anjos, M.F.; Yen, G.: Provably near-optimal solutions for very large single-row facility layout problems. Optim. Methods Softw. 24(4), 805-817 (2009)
7. Boenchendorf, K.: Reihenfolgenprobleme/Mean-flow-time sequencing. Mathematical Systems in Economics 74. Verlagsgruppe Athenaum, Hain, Scriptor (1982)
8. Buchheim, C.; Wiegele, A.; Zheng, L.: Exact algorithms for the quadratic linear ordering problem. INFORMS J. Comput. 22(1), 168-177 (2009)
9. Caprara, A.; Jung M.; Oswald, M.; Reinelt, G.; Traversi, E.: A betweenness approach for solving the linear arrangement problem. Technical report, University of Heidelberg (2011, in preparation)
10. Caprara, A.; Letchford, A.N.; Salazar-Gonzalez, J.-J.: Decorous lower bounds for minimum linear arrangement. INFORMS J. Comput. 23(1), 26-40 (2011)
11. Chenery, H.; Watanabe, T.: International comparisons of the structure of production. Econometrica 26, 487-521 (1958)
12. Chimani, M.; Hungerländer, P.; Jünger, M.; Mutzel, P.: An SDP approach to multi-level crossing minimization. In: Proceedings of Algorithm Engineering & Experiments [ALENEX'2011] (2011)
13. Christof, T.; Oswald, M.; Reinelt, G.: Consecutive ones and a betweenness problem in computational biology. In: Proceedings of the 6th Conference on Integer Programming and Combinatorial Optimization (IPCO 1998). Lecture Notes in Computer Science, vol. 1412, pp. 213-228. Springer, Berlin (1998)
14. Duff, I.S.; Grimes, R.G.; Lewis, J.G.: Users' Guide for the Harwell-Boeing Sparse Matrix Collection. Technical report, CERFACS, Toulouse, France (1992)
15. Fischer, I.; Gruber, G.; Rendl, F.; Sotirov, R.: Computational experience with a bundle method for semidefinite cutten plane relaxations of max-cut and equipartition. Math. Program. 105, 451-469 (2006)
16. Garey, M.R.; Johnson, D.S.; Stockmeyer, L.: Some simplified np-complete problems. In: STOC '74: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, pp. 47-63, New York (1974)
17. Glover, F.; Klastorin, T.; Klingman, D.: Optimal weighted ancestry relationships. Manag. Sci. 20, 1190-1193 (1974)
18. Goemans, M.; Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115-1145 (1995)
19. Grötschel, M.; Jünger, M.; Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32(6), 1195-1220 (1984)
20. Harper, L.H.: Optimal assignments of numbers to vertices. SIAM J. Appl. Math. 12(1), 131-135 (1964)
21. Healy, P.; Kuusik, A.: The vertex-exchange graph: a new concept for multilevel crossing minimisation. In: Proceedings of the Symposium on Graph Drawing [GD'99], pp. 205-216. Springer, Berlin (1999)
22. Helmberg, C.: Fixing variables in semidefinite relaxations. SIAM J. Matrix Anal. Appl. 21(3), 952-969 (2000)
23. Helmberg, C.; Mohar, B.; Poljak, S.; Rendl, F.: A spectral approach to bandwidth and separator problems in graphs. Linear Multilinear Algebra 39, 73-90 (1995)
24. Helmberg, C.; Rendl, F.; Vanderbei, R.; Wolkowicz, H.: An interior-point method for semidefinite programming. SIAM J. Optim. 6, 342-361 (1996)
25. Heragu, S.S.; Kusiak, A.: Machine layout problem in flexible manufacturing systems. Oper. Res. 36(2), 258-268 (1988)
26. Hiriart-Urruty, J.-B.; Lemarechal, C.: Convex Analysis and Minimization Algorithms (vol. 1 and 2). Springer, Berlin (1993)
27. Hungerländer, P.: Semidefinite Approaches to Ordering Problems. PhD thesis, Alpen-Adria Universität Klagenfurt (2012)
28. Hungerländer, P.; Rendl, F.: A computational study and survey of methods for the single-row facility layout problem. Comput. Optim. Appl. (2012, accepted)
29. Jünger, M.; Mutzel, P.: 2-Layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1, 1-25 (1997)
30. Juvan, M.; Mohar, B.: Optimal linear labelings and eigenvalues of graphs. Discrete Appl. Math. 36(2), 153-168 (1992)
31. Kaas, R.: A branch and bound algorithm for the acyclic subgraph problem. Eur. J. Oper. Res. 8(4), 355-362 (1981)
32. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. ACM, New York (1993)
33. Leontief, W.: Quantitative input-output relations in the economic system of the united states. Rev. Econ. Stat. 18(3), 105-125 (1936)
34. Lovász, L.; Schrijver, A.: Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim. 1, 166-190 (1991)
35. Mart, R.; Reinelt, G.; Duarte, A.: A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput. Optim. Appl. 51(3), 1-21 (2011)
36. Martí, R.; Laguna, M.: Heuristics and meta-heuristics for 2-layer straight line crossing minimization. Discrete Appl. Math. 127(3), 665-678 (2003)
37. Mitchell, J.E.; Borchers, B.: Solving linear ordering problems with a combined interior pointsimplex cutting plane algorithm. In: Frenk, T.T.H.; Roos, K.; Zhang, S. (eds.) High Performance Optimization, pp. 349-366. Kluwer, Dordrecht (2000)
38. Newman, A.: Cuts and orderings: on semidefinite relaxations for the linear ordering problem. In: Jansen, K.; Khanna, S.; Rolim, J.; Ron, D. (eds.) Lecture Notes in Computer Science, vol. 3122, pp. 195-206. Springer, Berlin (2004)
39. Schwarz, R.: A Branch-and-Cut Algorithm with Betweenness Variables for the Linear Arrangement Problems. Diploma thesis, Heidelberg (2010)
40. Sherali, H.D.; Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411-430 (1990)
41. Simmons, D.M.: One-dimensional space allocation: an ordering algorithm. Oper. Res. 17, 812-826 (1969)
42. Simone, C.D.: The cut polytope and the Boolean quadric polytope. Discrete Math. 79(1), 71-75 (1990)
43. Sturm, J.: Using SeDuMi 1.02, a Matlab toolbox for optimization over symmetric cones (updated for version 1.05). Available under http://sedumi.ie. lehigh.edu (2001)
44. Sugiyama, K.; Tagawa, S.; Toda, M.: Methods for visual understanding of hierarchical system structures. IEEE Trans. Syst. Man Cybern. 11(2), 109-125 (1981)