Pages that link to "Item:Q1382257"
From MaRDI portal
The following pages link to A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257):
Displaying 8 items.
- The balanced traveling salesman problem (Q614063) (← links)
- The balanced linear programming problem (Q1278929) (← links)
- A strongly polynomial contraction-expansion algorithm for network flow problems (Q1652310) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- A NETWORK SIMPLEX METHOD FOR THE MAXIMUM BALANCED FLOW PROBLEM (Q3818096) (← links)
- Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
- A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)