Finding feasible vectors of Edmonds-Giles polyhedra

DOI10.1016/0095-8956(84)90029-7zbMATH Open0544.05016DBLPjournals/jct/Frank84OpenAlexW2000317174WikidataQ56987202 ScholiaQ56987202MaRDI QIDQ796541FDOQ796541

András Frank

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90029-7

Recommendations

• \(f\)-vectors of polyhedra
• Separating hyperplanes of edge polytopes
• On the Determination of Minimal Facets and Edges of a Polyhedral Set
• scientific article
• On the Gamma-Vector of Symmetric Edge Polytopes
• scientific article; zbMATH DE number 5956571
• On face vectors and vertex vectors of convex polyhedra
• Approximating \(3\)-dimensional convex bodies by polytopes with a restricted number of edges
• Minimizing visible edges in polyhedra
• Polyhedral approaches

zbMATH Keywords

intersecting familiessubmodular functionsEdmonds-Giles polyhedroninteger valued modular function

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Algorithms in computer science (68W99)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The ellipsoid method and its consequences in combinatorial optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Minimax Theorem for Directed Graphs
• A Primal-Dual Algorithm for Submodular Flows
• Minimum cost flow with set-constraints
• Computing Maximal “Polymatroidal” Network Flows
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• Title not available (Why is that?)
• A weighted matroid intersection algorithm
• Testing membership in matroid polyhedra
• On total dual integrality
• Matroid Intersection
• Title not available (Why is that?)
• Title not available (Why is that?)
• How to make a digraph strongly connected
• Title not available (Why is that?)
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• An Algorithm for Submodular Functions on Graphs
• Total dual integrality and b-matchings

Cited In (20)

• An application of submodular flows
• Directed submodularity, ditroids and directed submodular flows
• A fast cost scaling algorithm for submodular flow
• Duality for balanced submodular flows
• A capacity scaling algorithm for M-convex submodular flow
• An out-of-kilter method for submodular flows
• Generalized polymatroids and submodular flows
• A dual algorithm for submodular flow problems
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Simple push-relabel algorithms for matroids and submodular flows
• A capacity scaling algorithm for convex cost submodular flows
• Integral infeasibility and testing total dual integrality
• Optimization over the polyhedron determined by a submodular function on a co-intersecting family
• Improved bound for the Carathéodory rank of the bases of a matroid
• Gradient methods of maximization of convex functions on discrete structures
• A Mazur-Orlicz type theorem for submodular set functions
• Optimum partitioning into intersections of ring families
• A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem
• Sandwich theorems for set functions
• A cost-scaling algorithm for \(0-1\) submodular flows

This page was built for publication: Finding feasible vectors of Edmonds-Giles polyhedra

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q796541)