A note on xQx as a modelling and solution framework for the Linear Ordering Problem
by Mark Lewis, Bahram Alidaee, Fred Glover, Gary Kochenberger
International Journal of Operational Research (IJOR), Vol. 5, No. 2, 2009

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.

Online publication date: Wed, 06-May-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Operational Research (IJOR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com