Pages that link to "Item:Q2158608"

The following pages link to Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608):

Displaying 9 items.

• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• Upgrading nodes in tree-shaped hub location (Q1628119) (← links)
• Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• Upgrading edges in the maximal covering location problem (Q2673553) (← links)
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
• Upgrading edges in the graphical TSP (Q6047867) (← links)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
• On the complexity of the upgrading version of the maximal covering location problem (Q6541022) (← links)