Pages that link to "Item:Q1650850"

The following pages link to Reverse selective obnoxious center location problems on tree graphs (Q1650850):

Displaying 11 items.

• Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
• Inverse quickest center location problem on a tree (Q1741512) (← links)
• Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks (Q2033986) (← links)
• Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks (Q2158608) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← 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)
• 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)