The linear ordering problem revisited

European Journal of Operational Research

Volumn 241, Issue 3, 2015, Pages 686-696

  Ceberio, Josu ^a   Mendiburu, Alexander ^a   Lozano, Jose A ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

Combinatorial optimization; Insert neighbourhood; Linear ordering problem; Local optima

Indexed keywords

COMBINATORIAL OPTIMIZATION; EFFICIENCY; LOCAL SEARCH (OPTIMIZATION);

ADDITIONAL EXPERIMENTS; GLOBALOPTIMUM; INSERT NEIGHBOURHOOD; LINEAR ORDERING PROBLEMS; LOCAL OPTIMA; OPTIMAL SOLUTIONS; STATIC INFORMATION; STOPPING CRITERIA;

SET THEORY;

EID: 84916611890     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.09.041     Document Type: Article

References (29)

1. Aujac H. La hiérarchie des industries dans un tableau des échanges interindustriels Revue Économique 11 2 1960 169 238
2. Becker O. Das helmstädtersche reihenfolgeproblem - Die effizienz verschiedener näherungsverfahren. In: Computers uses in the social sciences Berichteiner Working Conference 1967 Vienna
3. Betzler N.; Guo J.; Komusiewicz C.; Niedermeier R. Average parameterization and partial kernelization for computing medians Journal of Computer and System Sciences 77 4 2011 774 789
4. Blum C.; Roli A. Metaheuristics in combinatorial optimization: Overview and conceptual comparison ACM Computing Surveys 35 3 2003 268 308
5. Campos V.; Glover F.; Laguna M.; Martí R. An experimental evaluation of a scatter search for the linear ordering problem Journal of Global Optimization 21 4 2001 397 414
6. Ceberio, J.; Mendiburu, A.; & Lozano, J. A. (2013). The Plackett-Luce ranking model on permutation-based optimization problems. In: IEEE congress on evolutionary computation, pp. 494-501.
7. Chanas S.; Kobylanski P. A new heuristic algorithm solving the linear ordering problem Computational Optimization and Applications 6 2 1996 191 205
8. Charon I.; Hudry O. Lamarckian genetic algorithms applied to the aggregation of preferences Annals of Operations Research 80 0 1998 281 297
9. Charon I.; Hudry O. A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments Discrete Applied Mathematics 154 15 2006 2097 2116
10. Charon I.; Hudry O. A survey on the linear ordering problem for weighted or unweighted tournaments 4OR 5 1 2007 5 60
11. Chenery H.B.; Watanabe T. International comparisons of the structure of production Econometrica 26 4 1958 487 521
12. Chira C.; Pintea C.M.; Crisan G.C.; Dumitrescu D. Solving the linear ordering problem using ant models. In: Proceedings of the 11th Annual conference on Genetic and evolutionary computation, GECCO'09 2009 ACM New York, NY, USA pp.1803 1804
13. Garcia C.G.; Pérez-Brito D.; Campos V.; Martí R. Variable neighborhood search for the linear ordering problem Computers & Operations Research 33 12 2006 3549 3565
14. Garey M.R.; Johnson D.S. Computers and intractability: A guide to the theory of NP-completeness 1979 W. H. Freeman & Co. New York, NY, USA
15. Glover F.; Klastorin T.; Klingman D. Optimal weighted ancestry relationships Management science report series 1972 Business Research Division, Graduate School of Business Administration University of Colorado
16. Grötschel M.; Jünger M.; Reinelt G. A cutting plane algorithm for the linear ordering problem Operations Research 32 6 1984 1195 1220
17. Kaas R. A branch and bound algorithm for the acyclic subgraph problem European Journal of Operational Research 8 4 1981 355 362
18. Kemeny J.G. Mathematics without numbers Daedalus 88 1959 577 591
19. Kernighan B.W.; Lin S. An efficient heuristic procedure for partitioning graphs The Bell System Technical Journal 49 1 1970 291 307
20. Laguna M.; Marti R.; Campos V. Intensification and diversification with elite tabu search solutions for the linear ordering problem Computers & Operations Research 26 1999 1217 1230
21. Leontief W. Input-output economics 2008 Cambridge University Press
22. Martí R.; Reinelt G. The linear ordering problem: Exact and heuristic methods in combinatorial optimization Vol. 175 2011 Springer
23. Martí R.; Reinelt G.; Duarte A. A benchmark library and a comparison of heuristic methods for the linear ordering problem Computational Optimization and Applications 51 3 2012 1297 1317
24. Mitchell J.; Borchers B. Solving real-world linear ordering problems using a primal-dual interior point cutting plane method Annals of Operations Research 62 1 1996 253 276
25. Mitchell J.; Borchers B. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm H. Frenk K. Roos T. Terlaky S. Zhang High performance optimization. Applied Optimization Vol. 33 2000 Springer USA 349 366
26. Pintea C.-M.; Crisan G.C.; Chira C.; Dumitrescu D. A hybrid ant-based approach to the economic triangulation problem for input-output tables. In: Proceedings of the 4th international conference on hybrid artificial intelligence systems, HAIS'09 2009 Springer-Verlag Berlin, Heidelberg 376 383
27. Pop P.; Matei O. A genetic programming approach for solving the linear ordering problem E. Corchado V. Snášel A. Abraham M. Woźniak M. Graña S.-B. Cho Hybrid artificial intelligent systems. Lecture Notes in Computer Science Vol. 7209 2012 Springer Berlin Heidelberg 331 338
28. Schiavinotto T.; Stützle T. The linear ordering problem: Instances, search space analysis and algorithms Journal of Mathematical Modelling and Algorithms 3 4 2004 367 402
29. Tromble R.; Eisner J. Learning linear ordering problems for better translation Proceedings of the 2009 conference on empirical methods in natural language processing EMNLP'09 Vol. 2 2009 1007 1016