Pages that link to "Item:Q4291483"

The following pages link to Improving the location of minimax facilities through network modification (Q4291483):

Displaying 27 items.

• Minimising maximum response time (Q336510) (← links)
• Improving the location of minisum facilities through network modification (Q689226) (← links)
• The inverse 1-maxian problem with edge length modification (Q941835) (← links)
• Reverse 2-median problem on trees (Q943832) (← links)
• A further study on inverse linear programming problems (Q1298792) (← links)
• Weight reduction problems with certain bottleneck objectives. (Q1417504) (← links)
• Some reverse location problems (Q1576337) (← links)
• Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← links)
• Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs (Q1685960) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
• Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
• The center location improvement problem under the Hamming distance (Q1781802) (← links)
• Assigning weights to minimize the covering radius in the plane (Q2331208) (← links)
• Inverse median problems (Q2386211) (← links)
• Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
• Reverse 1-center problem on weighted trees (Q2790878) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
• Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701) (← links)
• Further Study on Reverse 1-Center Problem on Trees (Q5149548) (← links)
• Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
• The Minmax Regret Reverse 1-Median Problem on Trees with Uncertain Vertex Weights (Q6053538) (← links)
• Inverse and reverse 2-facility location problems with equality measures on a network (Q6112991) (← links)
• The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction (Q6159691) (← links)
• The reverse selective balance center location problem on trees (Q6191728) (← links)
• Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)