A note on xQx as a modelling and solution framework for the linear ordering problem

DOI10.1504/IJOR.2009.025005zbMATH Open1169.90399OpenAlexW2103358732MaRDI QIDQ840578FDOQ840578

Mark W. Lewis, Bahram Alidaee, Fred Glover, Gary A. Kochenberger

Publication date: 13 September 2009

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2009.025005

zbMATH Keywords

modellingmetaheuristicsinteger programminglinear orderingunconstrained quadratic binary programs

Mathematics Subject Classification ID

Linear programming (90C05)

Cited In (6)

• Global Approaches for Facility Layout and VLSI Floorplanning
• The unconstrained binary quadratic programming problem: a survey
• A hybrid metaheuristic approach to solving the UBQP problem
• Using \(xQx\) to model and solve the uncapacitated task allocation problem
• Applications and Computational Advances for Solving the QUBO Model
• SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic

Uses Software

• xQx

   Recommendations

• A linearization framework for unconstrained quadratic (0-1) problems 👍 👎
• A unified framework for modeling and solving combinatorial optimization problems: a tutorial 👍 👎
• Solving the maximum edge weight clique problem via unconstrained quadratic programming 👍 👎
• Using \(xQx\) to model and solve the uncapacitated task allocation problem 👍 👎
• The unconstrained binary quadratic programming problem: a survey 👍 👎

This page was built for publication: A note on xQx as a modelling and solution framework for the linear ordering problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840578)