MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  The Interval Order Polytope of a Digraph

Download:
Download as a PDF | Download as a PS
by Rudolf M Uller, Rudolf Muller, Andreas S. Schulz, Andreas S. Schulz
ftp://ftp.math.tu-berlin.de/pub/Preprints/combi/Report-401-1994.ps.Z
Add To MetaCart

Abstract:

berlin

Citations

7703 Computers and Intractability: A Guide to the Theory of NP-Completeness – Garey, Johnson - 1979
774 Integer and Combinatorial Optimization – Nemhauser, Wolsey - 1988
79 On certain polytopes associated with graphs – Chvátal - 1975
77 Complexity and algorithms for reasoning about time: A graph-theoretic approach – Golumbic, Shamir - 1993
40 Graph sandwich problems – Golumbic, Kaplan, et al. - 1995
39 Interval Orders and Interval Graphs: A Study of Partially Ordered Sets – Fishburn - 1985
38 Graph problems related to gate matrix layout and PLA folding – Mohring - 1990
34 On the complexity of dna physical mapping – Golumbic, Kaplan, et al. - 1994
27 The partition problem – Chopra, Rao - 1993
26 Facets of the linear ordering polytope – Grotschel, Junger, et al. - 1985
23 Facets of the Clique Partitioning Polytope – Grotschel, Wakabayashi - 1990
15 More facets from fences for linear ordering and acyclic subgraph polytopes – Leung, Lee - 1994
12 The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph – Balas - 1989
11 On the Transitive Acyclic Subdigraph Polytope – Muller - 1993
10 The order theoretic approach to scheduling : The deterministic case – Mohring, Radermacher - 1989
8 A necessary but insufficient condition for the stochastic binary choice problem – Gilboa - 1990
7 Odd cut-sets, odd cycles and 0-1/2 Chv`atal-Gomory cuts – Caprara, Fischetti - 1993
3 Bounds for linear VLSI problems – Muller - 1993
View or Download | Add to My Collection | Correct Errors