Pages that link to "Item:Q2790878"

The following pages link to Reverse 1-center problem on weighted trees (Q2790878):

Displaying 31 items.

• Optimizing budget allocation for center and median points (Q265070) (← links)
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← links)
• An optimal algorithm for the weighted backup 2-center problem on a tree (Q513273) (← links)
• Inverse center location problem on a tree (Q732826) (← links)
• Reverse 2-median problem on trees (Q943832) (← 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)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• Center problems with pos/neg weights on trees (Q1869485) (← links)
• Solving the absolute 1-center problem in the quickest path case (Q2119314) (← links)
• A survey of network interdiction models and algorithms (Q2294622) (← links)
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← links)
• Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• A model for the inverse 1-Median problem on trees under uncertain costs (Q2809658) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• (Q3572614) (← 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)
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← 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)
• Minimizing the expense transmission time from the source node to demand nodes (Q6497033) (← links)
• Robust reverse 1-center problems on trees with interval costs (Q6661114) (← links)