What people are saying - Write a review
We haven't found any reviews in the usual places.
2 Ray Fulkersons contributions to polyhedral combinatorics A
4 An algorithm for finding Hamiltonian circuits in certain graphs
9 other sections not shown
adjacent algorithm anti-blocking applied arcs assume blocker blocking pair bound called closed colouring combinatorial complete computation condition cone CONE(D consider constraints contains contradiction convex Corollary corresponding criterion defined definition denote described DIEGO directed dual edges elements equal equivalent example exists extreme fact feasible flow follows Fulkerson function give given graph Hence heuristic holds hypergraph implies incidence independent inequality integer interval Journal least Lemma LIBRARY linear programming Mathematics matrix matroids maximal method minimal neighbor Note obtained operations optimal Otherwise pair partial ordering partition path perfect matching permutation polyhedra polyhedron primal algorithm problem projective proof prove replaced Research respect result rows satisfying sequence similar simplex method solution Step subset Suppose Theorem theory University vector vertex vertices weight