Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem

We present and compare novel binary programs for linear ordering problems that involve the notion of asymmetric betweenness and expose relations to the quadratic linear ordering problem and its linearization. While two of the binary programs prove particularly superior from a computational point of...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:EURO journal on computational optimization Ročník 11; s. 100071
Hlavní autor: Mallach, Sven
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier 2023
Témata:
Betweenness problem
Binary quadratic programming
Facility layout problem
Linear ordering problem
Mixed-integer programming
ISSN:2192-4406
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We present and compare novel binary programs for linear ordering problems that involve the notion of asymmetric betweenness and expose relations to the quadratic linear ordering problem and its linearization. While two of the binary programs prove particularly superior from a computational point of view when many or all betweenness relations shall be modeled, the others arise as natural formulations that resemble important theoretical correspondences and provide a compact alternative for sparse problem instances. A reasoning for the strengths and weaknesses of the different formulations is derived by means of polyhedral considerations with respect to their continuous relaxations.
ISSN:2192-4406
DOI:10.1016/j.ejco.2023.100071