A note on xQx as a modelling and solution framework for the Linear Ordering Problem

International Journal of Operational Research

Volumn 5, Issue 2, 2009, Pages 152-162

  Lewis, Mark ^a   Alidaee, Bahram ^b   Glover, Fred ^c   Kochenberger, Gary ^d  

^a MISSOURI WESTERN STATE UNIVERSITY   (United States)

^b UNIVERSITY OF MISSISSIPPI   (United States)

^c UNIVERSITY OF COLORADO   (United States)

^d UNIVERSITY OF COLORADO   (United States)

Author keywords

Integer programming; Linear ordering; Metaheuristics

Indexed keywords

EID: 67649148256     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2009.025005     Document Type: Article

References (23)

1. Bar-Joseph, Z., Gifford, D.K. and Jaakkola, T.S. (2001) 'Fast optimal leaf ordering for hierarchical clustering'. Bioinformatics, Vol. 17, pp.S22-S29.
2. Belloni, A. and Lucena, A. (2003) 'Lagrangian heuristics for the linear ordering problem', Metaheuristics: Computer Decision-Making, Kluwer Academic Publishing, Norwell, MA, pp.37-63.
3. Biedl, T., Brejova, B., Demaine, E., Hamel, A. and Vinar, T. (2001) Optimal Arrangement of Leaves in the Tree Representing Hierarchical Clustering of Gene Expression Data, Technical Report 2001-14, University of Waterloo, Canada.
4. Boros, E. and Hammer, P.L. (2002) 'Pseudo-Boolean optimization', Discrete Allied Math., Vol. 123, Nos. 1-3, pp.155-225.
5. Bruyèrea, V. and Carton, O. (2007) 'Automata on linear orderings', Journal of Computer and System Sciences, Vol. 73, No. 1, pp.1-24.
6. Cooley, R. (2003) 'The use of web structure and content to identify subjectively interesting web usage patterns', ACM Transactions on Internet Technology, Vol. 3, No. 2, pp.93-116.
7. Fischetti, M., Lodi, A. and Glover, F. (2005) 'The feasibility pump', Mathematical Programming - Series A, Vol. 104, No. 1, pp.91-104.
8. Grötschel, M., Jünger, M. and Reinelt, G. (1984) 'A cutting plane algorithm for the linear ordering problem', Operations Research, Vol. 32, No. 6, pp.1195-1220.
9. Hammer, P. and Rudeanu, S. (Eds.) (1968) Boolean Methods in or and Related Areas, Springer-Verlag, Berlin, Heidelberg, New York.
10. Hansen, P. (1970) 'Methods of nonlinear 0-1 programming', Annals of Discrete Math., Vol. 5, pp.53-70.
11. Kochenberger, G., Glover, F., Alidaee, B. and Rego, C. (2005) 'An unconstrained binary programming approach to the vertex coloring problem', Annals of Operations Research, Vol. 139, pp.229-241.
12. Kochenberger, G.A., Glover, F., Alidaee, B. and Rego, C. (2004) 'A unified modeling and solution framework for combinatorial optimization problems', OR Spectrum, Vol. 26, No. 2, pp.237-250.
13. Laguna, M. and Martí, R. (Eds.) (2003) Scatter Search: Methodology and Implementations in C, Kluwer Academic Publishers, Boston.
14. Laguna, M., Martí, R. and Campos, V. (1999) 'Intensification and diversification with elite tabu search solutions for the linear ordering problem', Computers and Operations Research, Vol. 26, pp.1217-1230.
15. Lewis, M. (2005) A Path-Relinking Multi-Start Tabu Search Metaheuristic for Unconstrained Quadratic Binary Optimization, Hearin Center Technical Report HCES-01-05.
16. Lewis, M., Alidaee, B. and Kochenberger, G. (2005) 'Using xQx to model and solve the uncapacitated task allocation problem', Operations Research Letters, Vol. 33, pp.176-182.
17. LOLIB (1997) Linear Ordering Library, http://www.iwr.uni-heidelberg.de/iwr/comopt/soft.LOLIB/LOLIB.html
18. Mitchell, J.E. and Borchers, B. (2000) 'Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm', in Frenk, H. et al. (Eds.): High Performance Optimization, Kluwer Academic Publishers, pp.349-366.
19. Mitchell, J.E., Pardalos, P.P. and Resende, M.G.C. (1998) 'Interior point methods for combinatorial optimization', in Du, D.Z. and Pardalos, P. (Eds.): Handbook of Combinatorial Optimization, Vol. 1, Kluwer Academic Publishers, pp.189-297.
20. Palubeckis, G. (2004) 'Multistart tabu search strategies for the unconstrained binary quadratic optimization problem', Annals of Operations Research, Vol. 131, Nos. 1-4, pp.259-282.
21. Poranen, T. (2005) 'A genetic hillclimbing algorithm for the optimal linear arrangement problem', Fundamenta Informaticae, Vol. 68, No. 4, pp.333-356.
22. Rao, S. and Richa, A. (2004) 'New approximation techniques for some linear ordering problems'. SIAM J. Computing, Vol. 34, No. 2, pp.388-404.
23. Steiner, G. and Stephenson, P. (2000) 'Subset-restricted interchange for dynamic min-max scheduling problems', SIAM J. Discrete Math, Vol. 13, No. 4, pp.419-435.