DMCA
Low-Dimensional Linear Ordering Polytopes (1997)
| Venue: | SOLVING LINEAR ORDERING PROBLEMS 15 |
| Citations: | 7 - 1 self |
BibTeX
@TECHREPORT{Christof97low-dimensionallinear,
author = {Thomas Christof and Gerhard Reinelt},
title = {Low-Dimensional Linear Ordering Polytopes},
institution = {SOLVING LINEAR ORDERING PROBLEMS 15},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we discuss some new results on the structure of linear ordering polytopes. We give a linear description of the linear ordering polytope for n = 8 which we believe to be complete. Furthermore, we address the question of comparing facet-defining inequalities with respect to various criteria which may have impact on the development of branch-and-cut algorithms for the linear ordering problem.
Keyphrases
low-dimensional linear ordering polytopes linear ordering problem acyclic tournament corresponds complete digraph branch-and-cut algorithm facet-defining inequality vice versa acyclic tournament branch-and-cut algori introduction let various criterion linear description maximum weight arc weight new result various application linear ordering
