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

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

0.00 Avg rating0 Votes
Article ID: iaor200968885
Country: United Kingdom
Volume: 5
Issue: 2
Start Page Number: 152
End Page Number: 162
Publication Date: May 2009
Journal: International Journal of Operational Research
Authors: , , ,
Keywords: programming: integer
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.

Reviews

Required fields are marked *. Your email address will not be published.