Pages that link to "Item:Q4987701"

The following pages link to Some variants of reverse selective center location problem on trees under the Chebyshev and Hamming norms (Q4987701):

Displaying 8 items.

• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486) (← 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 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)
• 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)