Finding feasible vectors of Edmonds-Giles polyhedra
From MaRDI portal
Publication:796541
DOI10.1016/0095-8956(84)90029-7zbMATH Open0544.05016DBLPjournals/jct/Frank84OpenAlexW2000317174WikidataQ56987202 ScholiaQ56987202MaRDI QIDQ796541FDOQ796541
- \(f\)-vectors of polyhedra
- Separating hyperplanes of edge polytopes
- On the Determination of Minimal Facets and Edges of a Polyhedral Set
- scientific article; zbMATH DE number 3844526
- 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
- scientific article; zbMATH DE number 3885621 (Why is no real title available?)
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3862931 (Why is no real title available?)
- scientific article; zbMATH DE number 3661345 (Why is no real title available?)
- scientific article; zbMATH DE number 3580570 (Why is no real title available?)
- scientific article; zbMATH DE number 3334027 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- A Minimax Theorem for Directed Graphs
- A Primal-Dual Algorithm for Submodular Flows
- A weighted matroid intersection algorithm
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
- An Algorithm for Submodular Functions on Graphs
- Computing Maximal “Polymatroidal” Network Flows
- How to make a digraph strongly connected
- Matroid Intersection
- Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
- Minimum cost flow with set-constraints
- On total dual integrality
- Testing membership in matroid polyhedra
- The ellipsoid method and its consequences in combinatorial optimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Total dual integrality and b-matchings
(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)
