Pages that link to "Item:Q1333027"
From MaRDI portal
The following pages link to On combined minmax-minsum optimization (Q1333027):
Displaying 12 items.
- Inverse max + sum spanning tree problem by modifying the sum-cost vector under weighted \(l_\infty \) norm (Q486731) (← links)
- On the generality of the greedy algorithm for solving matroid base problems (Q496445) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_1\) norm by modifying the sum-cost vector (Q723499) (← links)
- An \(O(m\log n)\) algorithm for the max+sum spanning tree problem (Q1266709) (← links)
- Inverse max + sum spanning tree problem under Hamming distance by modifying the sum-cost vector (Q1685587) (← links)
- Multiple bottleneck assignment problem (Q1806893) (← links)
- Constrained balanced optimization problems (Q1963024) (← links)
- Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector (Q2089873) (← links)
- The quadratic balanced optimization problem (Q2339810) (← links)
- Quadratic bottleneck knapsack problems (Q2359152) (← links)
- A Survey on Multiple Objective Minimum Spanning Tree Problems (Q3637314) (← links)
