Pages that link to "Item:Q1680539"
From MaRDI portal
The following pages link to Upgrading min-max spanning tree problem under various cost functions (Q1680539):
Displaying 7 items.
- Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
- Upgrading edges in the maximal covering location problem (Q2673553) (← links)
- Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation (Q6047913) (← links)
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)
- A note on upgrading the min–max weight of a base of a matroid (Q6125977) (← links)