What people are saying - Write a review
We haven't found any reviews in the usual places.
Lifting the Facets of Polyhedra
Partitioning Spectra and Linear Programming
Oriented Matroids and Triangulations of Convex Polytopes
26 other sections not shown
Other editions - View all
adjacent apply arcs arrow assume Ax s b basic Meyniel graph bipartite graph box totally dual chain circuit clique cocircuit columns combinatorial optimization combinatorial optimization problems complete Computer connected components constraints contains corresponding crossing family decomposition defined denote digraph directed graph disjoint dynamic graph edges Edmonds element Ellipsoid Method equivalent eulerian path exists facet feasible finite G(Vi given graph G greedoid greedy algorithm Hence implies induced induced subgraph inequalities intersecting interval order lattice LEMMA Let G linear program linear system machines matching Math matrix maximal maximum minimal minimum number network flow nodes NP-complete obtain oriented matroid pairs partial order partially ordered set partition perfect graphs points polyhedra polyhedron polymatroid polynomial polytope proof result satisfies schedule Schrijver solve structure subgraph submodular function subsets supermodular theorem theory tion total dual integrality vector vertex vertices