What people are saying - Write a review
We haven't found any reviews in the usual places.
1 Characterizations of adjacency of faces of polyhedra A Bachem
3 Minimal cost flows in regular matroids R Burkard and H Hamacher
12 other sections not shown
adjacent affine independence algorithm alternating trail property assume assumptions bounded cocircuit computational cone(E constraints construction contains convergence convex cone convex functions convex set Corollary cost M-flow decision problem defined denote derived cone determined digraph of order DT-hypotraceable dual ellipsoid method eq(F equality set equation exists facet feasible solution fi(w finite function given graph hamiltonian path Hence holds HYPERPLANE hypohamiltonian hypotraceable digraphs implies isomorphism iteration join-meet Lemma Let G linear programming linearly independent Mathematical Programming matrix maximal M-flow minimal valid inequality multifunction negative circuit node nonempty nonlinear programming obtain optimal solution optimal step optimal value oracle order conditions parameters piecewise-linear approximation polyhedral polyhedron polynomially distinguished polytope positive definite Proposition prove regular matroids resp satisfies search problem Section self-transformable sequence solved subadditive subset Suppose Theorem theory transformation update formula vertices