A benchmark library and a comparison of heuristic methods for the linear ordering problem

Computational Optimization and Applications

Volumn 51, Issue 3, 2012, Pages 1297-1317

  Martí, Rafael ^a   Reinelt, Gerhard ^b   Duarte, Abraham ^c  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF HEIDELBERG   (Germany)

^c UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

Empirical comparison; Library; Metaheuristics

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL EXPERIMENT; EMPIRICAL COMPARISON; LINEAR ORDERINGS; META HEURISTIC ALGORITHM; META HEURISTICS; NEAR-OPTIMAL SOLUTIONS; NP-HARD; WEIGHTED DIGRAPH;

COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; LIBRARIES;

SET THEORY;

EID: 84862016970     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-010-9384-9     Document Type: Review

References (31)

1. Achatz, H., Kleinschmidt, P., Lambsdorff, J.: Der Corruption Perceptions Index und das Linear Ordering Problem. ORNews 26, 10-12 (2006)
2. Aujac, H.: La hiérarchie des industries dans un tableau des echanges industriels. Rev. Econ. 2, 169-238 (1960)
3. Becker, O.: Das Helmstädtersche Reihenfolgeproblem - die Effizienz verschiedener Näherungsver-fahren. In: Computer Uses in the Social Sciences, Bericht einer Working Conference des Inst. f. höh. Studien u. wiss. Forsch. Wien (1967)
4. Boenchendorf, K.: Reihenfolgenprobleme/Mean-Flow-Time Sequencing. Mathematical Systems in Economics, vol. 74. Verlagsgruppe Athenäum, Hain, Scriptor, Königstein (1982)
5. Campos, V., Glover, F., Laguna, M., Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. Glob. Optim. 21, 397-414 (2001) (Pubitemid 33672376)
6. Chanas, S., Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl. 6, 191-205 (1996) (Pubitemid 126706907)
7. Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5, 5-60 (2007)
8. Chenery, H.B., Watanabe, T.: International comparisons of the structure of production. Econometrica 26, 487-521 (1958)
9. Christof, T.: Low-dimensional 0/1-Polytopes and Branch-and-Cut in Combinatorial Optimization. Shaker, Aachen (1997)
10. Christof, T., Reinelt, G.: Combinatorial optimization and small polytopes. Top 4, 1-64 (1996)
11. Condorcet, M.J.A.N.: Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix (1785), Paris
12. Feo, T., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 2, 1-27 (1995)
13. Garcia, C.G., Pérez-Brito, D., Campos, V., Martí, R.: Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33, 3549-3565 (2006)
14. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533-549 (1986) (Pubitemid 17480188)
15. Glover, F., Klastorin, T., Klingman, D.: Optimal weighted ancestry relationships. Manag. Sci. 20, 1190-1193 (1974)
16. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)
17. Goemans, M.X., Hall, L.A.: The strongest facets of the acyclic subgraph polytope are unknown. In: Proc. of the 5th Int. IPCO Conference. LNCS, vol. 1084, pp. 415-429. Springer, Berlin (1996) (Pubitemid 126078635)
18. Grötschel, M., Jünger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32, 1195-1220 (1984) (Pubitemid 15457477)
19. Huang, G., Lim, A.: Designing a hybrid genetic algorithm for the linear ordering problem. In: Cantu-Paz, E., et al. (eds.) Proc. of Genetic and Evolutionary Computation-GECCO 2003. LNCS, vol. 2723, pp. 1053-1064. Springer, Berlin (2003)
20. Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145-184 (2003)
21. Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1, 1-25 (1997) (Pubitemid 38836461)
22. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291-308 (1979)
23. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading (1993)
24. Laguna, M., Martí, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217-1230 (1999) (Pubitemid 30024494)
25. Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic, Dordrecht (2003)
26. Leontief, W.: Quantitative input-output relations in the economic system of the United States. Rev. Econ. Stat. 18, 105-125 (1936)
27. Martí, R., Reinelt, G.: The Linear Ordering Problem: Exact and Heuristics Methods in Combinatorial Optimization. Applied Mathematical Sciences, vol. 175. Springer, Berlin (2010)
28. Mitchell, J.E., Borchers, B.: Solving linear ordering problems. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization. Applied Optimization, vol. 33, pp. 340-366. Kluwer Academic, Dordrecht (2000)
29. Reinelt, G.: The Linear Ordering Problem: Algorithms and Applications. Research and Exposition in Mathematics, vol. 8. Heldermann, Berlin (1985)
30. Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228-246 (2002)
31. Schiavinotto, T., Stützle, T.: The linear ordering problem: instances, search space analysis and algorithms. J. Math. Model. Algorithms 3, 367-402 (2004) (Pubitemid 40317584)