Pages that link to "Item:Q4981873"

The following pages link to An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions (Q4981873):

Displaying 27 items.

• Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
• Upgrading \(p\)-median problem on a path (Q894530) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← links)
• The inverse 1-center problem on cycles with variable edge lengths (Q1725838) (← links)
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks (Q1730835) (← links)
• Reverse 1-maxian problem with keeping existing 1-median (Q1735954) (← links)
• A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms (Q1788861) (← links)
• Classical and inverse median location problems under uncertain environment (Q1987593) (← links)
• Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
• Intuitionistic fuzzy inverse 1-median location problem on tree networks with value at risk objective (Q2318607) (← links)
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees (Q2337353) (← links)
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
• Inverse and reverse balanced facility location problems with variable edge lengths on trees (Q2656494) (← links)
• The inverse 1-median location problem on uncertain tree networks with tail value at risk criterion (Q2656787) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• A generalized interval type-2 fuzzy random variable based algorithm under mean chance value at risk criterion for inverse 1-median location problems on tree networks with uncertain costs (Q2668035) (← links)
• Reverse 1-center problem on weighted trees (Q2790878) (← links)
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
• Optimal algorithms for some inverse uncapacitated facility location problems on networks (Q5043849) (← links)
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
• Some polynomially solvable cases of the inverse ordered 1-median problem on trees (Q5162023) (← links)
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← links)
• On some inverse 1-center location problems (Q5382943) (← links)
• Reverse 1-centre problem on trees under convex piecewise-linear cost function (Q5882838) (← links)
• Optimal algorithms for integer inverse obnoxious \(p\)-median location problems on tree networks (Q6080433) (← links)
• The reverse selective balance center location problem on trees (Q6191728) (← links)
• A hybrid modified PSO algorithm for the inverse \(p\)-median location problem in fuzzy random environment (Q6495790) (← links)