Pages that link to "Item:Q796541"
From MaRDI portal
The following pages link to Finding feasible vectors of Edmonds-Giles polyhedra (Q796541):
Displaying 20 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- Duality for balanced submodular flows (Q581206) (← links)
- A cost-scaling algorithm for \(0-1\) submodular flows (Q678855) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- A Mazur-Orlicz type theorem for submodular set functions (Q1084205) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- Sandwich theorems for set functions (Q1114795) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- Optimization over the polyhedron determined by a submodular function on a co-intersecting family (Q1116890) (← links)
- Directed submodularity, ditroids and directed submodular flows (Q1116891) (← links)
- An application of submodular flows (Q1119596) (← links)
- A dual algorithm for submodular flow problems (Q1183393) (← links)
- A capacity scaling algorithm for convex cost submodular flows (Q1363412) (← links)
- Optimum partitioning into intersections of ring families (Q1363743) (← links)
- Improved bound for the Carathéodory rank of the bases of a matroid (Q1400967) (← links)
- A capacity scaling algorithm for M-convex submodular flow (Q1777220) (← links)
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time. (Q1850505) (← links)
- Simple push-relabel algorithms for matroids and submodular flows (Q1926643) (← links)
- A cost-scaling algorithm for minimum-cost node-capacitated multiflow problem (Q2089770) (← links)
- Gradient methods of maximization of convex functions on discrete structures (Q3747234) (← links)
