Pages that link to "Item:Q1102979"

The following pages link to On finding most uniform spanning trees (Q1102979):

Displaying 17 items.

• On discrete optimization with ordering (Q367635) (← links)
• The balanced traveling salesman problem (Q614063) (← links)
• Robust balanced optimization (Q668952) (← links)
• An inverse model for the most uniform problem (Q924880) (← links)
• An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709) (← links)
• Minimum dispersion problems (Q1363766) (← links)
• Lexicographic balanced optimization problems (Q1433654) (← links)
• The minimum labeling spanning trees (Q1567492) (← links)
• Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
• Constrained balanced optimization problems (Q1963024) (← links)
• The quadratic balanced optimization problem (Q2339810) (← links)
• Balanced Optimization with Vector Costs (Q2971159) (← links)
• (Q5116484) (← 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)
• Computing fair and bottleneck matchings in geometric graphs (Q6487431) (← links)