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

Mark Lewis, Bahram Alidaee, Fred Glover and Gary Kochenberger

International Journal of Operational Research, 2009, vol. 5, issue 2, 152-162

Abstract: 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: linear ordering; integer programming; metaheuristics; unconstrained quadratic binary programs; modelling. (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.inderscience.com/link.php?id=25005 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijores:v:5:y:2009:i:2:p:152-162

Access Statistics for this article

More articles in International Journal of Operational Research from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().