The following pages link to (Q3908745):
Displaying 15 items.
- A fast cost scaling algorithm for submodular flow (Q294751) (← links)
- About the minimum mean cycle-canceling algorithm (Q499347) (← links)
- A min-max relation for stable sets in graphs with no odd-\(K_ 4\) (Q582302) (← links)
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
- Non-standard approaches to integer programming (Q697562) (← links)
- Uncertain minimum cost flow problem (Q894387) (← links)
- An out-of-kilter method for submodular flows (Q1095780) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- Polynomial-time primal simplex algorithms for the minimum cost network flow problem (Q1193519) (← links)
- Minimum-cost flows in unit-capacity networks (Q1693987) (← links)
- Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm (Q1751136) (← links)
- A faster polynomial algorithm for the constrained maximum flow problem (Q1761207) (← links)
- A new scaling algorithm for the minimum cost network flow problem (Q1970413) (← links)
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems (Q6139374) (← links)
