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

DOI10.1504/IJOR.2009.025005MaRDI QIDQ840578zbMATH OpenOpenAlexFDO

Authors 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)

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

Cited in

(8)

• Applications and computational advances for solving the QUBO model
• A unified framework for modeling and solving combinatorial optimization problems: a tutorial
• 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
• Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem
• Global approaches for facility layout and VLSI floorplanning
• SOLO: A Linear Ordering Approach to Path Analysis of Web Site Traffic

Describes a project that uses

Uses Software

• xQx

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)