Skip to main content
Article thumbnail
Location of Repository

The cut cone III: On the role of triangle facets (Updated version).

By M.M. Deza, M. Laurent and S. Poljak
OAI identifier:

Suggested articles

Citations

  1. (1982). A polynomial algorithm for constructing a large bipartite subgraph with an application to satisfiability problem,
  2. (1986). A polynomial heuristic for certain subgraph optimization problems with guaranteed lower bound.
  3. (1989). Collapsing and lifting for the cut cone.
  4. (1989). Computing extreme rays of the metric cone for seven points.
  5. (1967). Convex polytopes.
  6. (1986). Matching theory. Akad6miai Kiado,
  7. (1989). Max-cut in circulant graphs.
  8. (1969). On a method of solution of integer linear programming problems of a special kind.
  9. (1983). On qualitatively independent partitions and related problems,
  10. (1986). On the cut polytope.
  11. (1980). On the extreme rays of the metric cone.
  12. (1990). P.L.: Cut-polytopes, boolean quadric polytopes and nonnegative quadratic pseudo-boolean functions.
  13. (1973). Some extremal properties of bipartite subgraphs.
  14. (1982). Sous-espaces de LI et inrgalitrs hypermrtriques.
  15. (1989). The boolean quadric polytope: some characteristics, facets and relatives,
  16. (1988). The cut cone I. Research Memerandum RMI 88-13,
  17. (1989). The cut cone II: clique-web facets.
  18. (1990). The even and odd cut polytopes.
  19. (1991). The symmetries of the cut polytope and of some relatives. In: Applied Geometry and Discrete Mathematics, the "Victor Klee Festschrift"

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.