The Interval Order Polytope of a Digraph

@inproceedings{Mller1995TheIO,
  title={The Interval Order Polytope of a Digraph},
  author={Rudolf M{\"u}ller and Andreas S. Schulz},
  booktitle={IPCO},
  year={1995}
}
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 almost 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… CONTINUE READING

From This Paper

Topics from this paper.
15 Citations
19 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Bounds for linear VLSI problems

  • R M Uller
  • Bounds for linear VLSI problems
  • 1993

Odd cut-sets, odd cycles and 0-1/2 Chvv atal- Gomory cuts

  • Cf A Caprara, M Fischetti
  • Odd cut-sets, odd cycles and 0-1/2 Chvv atal…
  • 1993

On the transitive acyclic subdigraph polytope

  • R M Uller
  • Proceedings of the Third Conference on Integer…
  • 1993

On the complexity of DNA physical mapping

  • M C Gks92b, H Golumbic, R Kaplan, Shamir
  • On the complexity of DNA physical mapping
  • 1992

Graph problems related to gate matrix layout and PLA folding

  • Mm, R H Mm, Ohring
  • MM oh94] R. H. MM ohring
  • 1990

Similar Papers

Loading similar papers…