Mathematical Programming at Oberwolfach II, Volume 2 |
Contents
Preface | 1 |
W Cook L Lovász and A Schrijver A polynomialtime test for total | 64 |
J Fonlupt and M Raco Orientation of matrices | 86 |
Copyright | |
7 other sections not shown
Common terms and phrases
a₁ algorithm apply approximation b-KEG b₁ bipartite bipartite graph C₁ cocircuit column Combinatorial components computed cone constraints contains convex convex set Corollary corresponding cross-free cycle define denote digraph distributive lattice edge equation error exists extreme points feasible solution finite flow problem follows fractional b-matching Gaussian elimination given graph G Hence inequalities iteration Lemma linear program lower bound M₁ Mathematical Programming matrix matroid maximum minimal minimum MIP-representable network flow node nondegeneracy nondegenerate nonempty nonlinear nonlinear programming nonzero element obtain Operations Research optimal solution orientation partition path polyhedra polyhedron polymatroid polynomial proof of Theorem Proposition quasi-Newton methods rec(S recession directions representation S₁ satisfying Section simplex algorithm simplex method solving spanning strongly connected submodular flow submodular function submodular system subset supermodular T-join Theorem Theorem 2.1 totally dual integral u₁ V₁ variables vertex vertices x₁