Pages that link to "Item:Q4173379"
From MaRDI portal
The following pages link to A Minimax Theorem for Directed Graphs (Q4173379):
Displaying 6 items.
- Finding feasible vectors of Edmonds-Giles polyhedra (Q796541) (← links)
- A strongly polynomial minimum cost circulation algorithm (Q1079110) (← links)
- Generalized polymatroids and submodular flows (Q1116889) (← links)
- The ellipsoid method and its consequences in combinatorial optimization (Q1168215) (← links)
- On the ratio of optimal integral and fractional covers (Q1224109) (← links)
- On enumerating all minimal solutions of feedback problems (Q1348395) (← links)
