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

Mark Lewis | Zendy; Bahram Alidaee | Zendy; Fred Glover | Zendy; Gary Kochenberger | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Mark Lewis,

Bahram Alidaee,

Fred Glover,

Gary Kochenberger

Publication year - 2009

Publication title -

international journal of operational research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.314

H-Index - 27

eISSN - 1745-7653

pISSN - 1745-7645

DOI - 10.1504/ijor.2009.025005

Subject(s) - mathematical optimization , computer science , range (aeronautics) , quadratic equation , binary number , algorithm , mathematics , materials science , geometry , arithmetic , composite material

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research