Search space analysis of the linear ordering problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2611, Issue , 2003, Pages 322-333

  Schiavinotto, Tommaso ^a   Stützle, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; OPTIMIZATION;

ALGORITHMIC APPROACH; AUTOCORRELATION LENGTH; BETTER PERFORMANCE; COMBINATORIAL OPTIMIZATION PROBLEMS; FITNESS-DISTANCE CORRELATION; ITERATED LOCAL SEARCH; LINEAR ORDERING PROBLEMS; STATE OF THE ART;

SET THEORY;

EID: 21144442924     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36605-9_30     Document Type: Article

References (19)

1. O. Becker. Das Helmstädtersche Reihenfolgeproblem - die Effizienz verschiedener Näherungsverfahren. In Computer uses in the Social Science, Wien, January 1967.
2. V. Campos, M. Laguna, and R. Martí. Scatter search for the linear ordering problem. In D. Come et al., editor, New Ideas in Optimization, pages 331-339. McGraw-Hill, 1999.
3. S. Chanas and P. Kobylanski. A new heuristic algorithm solving the linear ordering problem. Computational Optimization and Applications, 6:191-205, 1996.
4. T. Christof and G. Reinelt. Low-dimensional linear ordering polytopes. Technical report, University of Heidelberg, Germany, 1997.
5. R. K. Congram. Polynomially Searchable Exponential Neighbourhoods for Sequencing Problems in Combinatorial Optimisation. PhD thesis, University of Southampton, Faculty of Mathematical Studies, UK, 2000.
6. M. Grötschel, M. Jünger, and G. Reinelt. A cutting plane algorithm for the linear ordering problem. Operations Research, 32(6):1195-1220, 1984.
7. M. Grötschel, M. Jünger, and G. Reinelt. Optimal triangulation of large real world input-output matrices. Statistische Hefte, 25:261-295, 1984.
8. H.H. Hoos and T. Stützle. Evaluating Las Vegas algorithms - pitfalls and remedies. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 238-245. Morgan Kaufmann, San Francisco, 1998.
9. T. Jones and S. Forrest. Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In L.J. Eshelman, editor, Proc. of the 6th International Conference on Genetic Algorithms, pages 184-192. Morgan Kaufman, San Francisco, 1995.
10. D. E. Knuth. The Stanford GraphBase: A Platform for Combinatorial Computing. Addison Wesley, New York, 1993.
11. M. Laguna, R. Martí, and V. Campos. Intensification and diversification with elite tabu search solutions for the linear ordering problem. Computers and Operation Research, 26:1217-1230, 1999.
12. H. R. Lourenço, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management Science, pages 321-353. Kluwer Academic Publishers, Norwell, MA, 2002.
13. P. Merz and B. Freisleben. Fitness landscapes and memetic algorithm design. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 245-260. McGraw-Hill, London, 1999.
14. J. E. Mitchell and B. Borchers. Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm. In H. L. Frenk et al., editor, High Performance Optimization, pages 349-366. Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000.
15. C. R. Reeves. Landscapes, operators and heuristic search. Annals of Operational Research, 86:473-490, 1999.
16. P. Stadler. Towards a theory of landscapes. In R. Lopéz-Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck, and F. Zertuche, editors, Complex Systems and Binary Networks, volume 461, pages 77-163, Berlin, New York, 1995. Springer Verlag.
17. P. Stadler. Landscapes and their correlation functions. J. of Math. Chemistry, 20:1-45, 1996.
18. Standard Performance Evaluation Corporation. SPEC CPU95 and CPU2000 Benchmarks. http://www.spec.org/, November 2002.
19. E. D. Weinberger. Correlated and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325-336, 1990.