Pages that link to "Item:Q1382257"

The following pages link to A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257):

Displaying 4 items.

• The balanced traveling salesman problem (Q614063) (← links)
• The quadratic balanced optimization problem (Q2339810) (← 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)