Pages that link to "Item:Q1026756"

The following pages link to Up- and downgrading the 1-center in a network (Q1026756):

Displaying 12 items.

• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams (Q512990) (← links)
• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
• Upgrading min-max spanning tree problem under various cost functions (Q1680539) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
• The minmax regret inverse maximum weight problem (Q2243298) (← links)
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric (Q2267315) (← links)
• Upgrading edges in the maximal covering location problem (Q2673553) (← 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)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)