A note on xQx as a modelling and solution framework for the linear ordering problem This paper expands the list of $0-1$ problems that can be effectively modelled and solved as unconstrained quadratic binary programs (UQPs). UQP has been presented as a general-purpose modelling approach with application to a broad range of problem classes (Kochenberger et al., 2004). In this paper, we demonstrate that the linear ordering problem (LOP) can be easily recast so that it can be treated as a UQP problem, and that large instances of the LOP can be effectively handled within this framework. Computational results are given demonstrating the viability and attractiveness of this approach.
Keywords for this software
References in zbMATH (referenced in 4 articles )
Showing results 1 to 4 of 4.
- Kochenberger, Gary; Hao, Jin-Kao; Glover, Fred; Lewis, Mark; Lü, Zhipeng; Wang, Haibo; Wang, Yang: The unconstrained binary quadratic programming problem: a survey (2014)
- Buchheim, Christoph; Wiegele, Angelika; Zheng, Lanbo: Exact algorithms for the quadratic linear ordering problem (2010)
- Lü, Zhipeng; Glover, Fred; Hao, Jin-Kao: A hybrid metaheuristic approach to solving the UBQP problem (2010)
- Lewis, Mark; Alidaee, Bahram; Glover, Fred; Kochenberger, Gary: A note on xQx as a modelling and solution framework for the linear ordering problem (2009)