Pages that link to "Item:Q1026756"

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

Displaying 5 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)