Pages that link to "Item:Q1087546"

The following pages link to Most and least uniform spanning trees (Q1087546):

Displaying 18 items.

• The balanced traveling salesman problem (Q614063) (← links)
• Robust balanced optimization (Q668952) (← links)
• An inverse model for the most uniform problem (Q924880) (← links)
• On finding most uniform spanning trees (Q1102979) (← links)
• The image of weighted combinatorial problems (Q1179736) (← links)
• The balanced linear programming problem (Q1278929) (← links)
• Minimum dispersion problems (Q1363766) (← links)
• A strongly polynomial algorithm for the uniform balanced network flow problem (Q1382257) (← links)
• The minimum labeling spanning trees (Q1567492) (← links)
• Exact algorithms for the equitable traveling salesman problem (Q1753595) (← links)
• In memoriam Paolo M. Camerini (Q1803668) (← links)
• Solving combinatorial problems with combined min-max-min-sum objective and applications (Q1824562) (← links)
• The quadratic balanced optimization problem (Q2339810) (← links)
• Balanced Optimization with Vector Costs (Q2971159) (← links)
• Balanced paths in acyclic networks: Tractable cases and related approaches (Q4667719) (← links)
• COMPUTATIONAL METHODS FOR LOGISTICS PROBLEMS RELATED TO OPTIMAL TREES (Q5370788) (← links)
• Quadratic bottleneck problems (Q5392805) (← links)
• A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381) (← links)