What people are saying - Write a review
We haven't found any reviews in the usual places.
Complexity and Algorithms
Facets of the Antichain Polytope
Computational Results for Problem MWLA
3 other sections not shown
0-1 integer programming affinely independent antichain polytope bipartite graph cardinality limit chain polytope facet Chapter class of facets class of Figure coefficients complement graph Computational results current LP cut opt cutting plane algorithm cutting plane approach cutting plane implementation described in Theorem directed acyclic graph edges elements exact cover example facet class find a maximum graph G Hasse diagram ill0a ill2a ill7a incidence vectors integer programming problems integral optimal solutions l)-antichain facets linear programming lower bound max-cut maximal antichain facets maximal chain facets maximum weight antichain maximum weight chain minimal node cover minimum cut MPLA MPLC MWLA problems nodes in Sj NP-complete NP-hard partially ordered set polynomial-time algorithm polynomial-time solvable polytope facet analogous poset problem MWLC represents a facet results for MWLA S2 u S2 separation algorithm sequential lifting solved strong cutting plane subproblem subset transitively orientable type of facet valid inequality