@inproceedings{842758def84f4152854c3b66298743af,
title = "The interval order polytope of a digraph",
abstract = "We introduce the interval order polytope of a digraph D as the convex hull of interval order inducing arc subsets of D. Two general schemes for producing valid inequalities are presented. These schemes have been used implicitly for several polytopes and they are applied here to the interval order polytope. It is shown that Mmost all known classes of valid inequalities of the linear ordering polytope can be explained by the two classes derived from these schemes. We provide two applications of the interval order polytope to combinatorial optimization problems for which to our knowledge no polyhedral descriptions have been given so far. One of them is related to analyzing DNA subsequences.",
author = "Rudolf M{\"u}ller and Schulz, {Andreas S.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1995.; 4th International Conference on Integer Programming and Combinatorial Optimization, IPCO 1995 ; Conference date: 29-05-1995 Through 31-05-1995",
year = "1995",
doi = "10.1007/3-540-59408-6_41",
language = "English",
isbn = "9783540594086",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "50--64",
editor = "Egon Balas and Jens Clausen",
booktitle = "Integer Programming and Combinatorial Optimization - 4th International IPCO Conference, 1995, Proceedings",
}