Pages that link to "Item:Q941835"

The following pages link to The inverse 1-maxian problem with edge length modification (Q941835):

Displaying 34 items.

• A linear time algorithm for inverse obnoxious center location problems on networks (Q301046) (← links)
• An inverse approach to convex ordered median problems in trees (Q421273) (← links)
• Inverse 1-median problem on trees under weighted Hamming distance (Q445338) (← links)
• Inverse \(p\)-median problems with variable edge lengths (Q532535) (← links)
• Uniform-cost inverse absolute and vertex center location problems with edge length variations on trees (Q534329) (← links)
• The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
• Inverse median location problems with variable coordinates (Q623783) (← links)
• The \(p\)-maxian problem on block graphs (Q711397) (← links)
• The inverse Fermat-Weber problem (Q976390) (← links)
• Up- and downgrading the 1-center in a network (Q1026756) (← links)
• Inverse 1-center location problems with edge length augmentation on trees (Q1044223) (← links)
• Upgrading the 1-center problem with edge length variables on a tree (Q1662640) (← links)
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs (Q1697898) (← 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)
• Inverse quickest center location problem on a tree (Q1741512) (← 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)
• 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)
• Computation of inverse 1-center location problem on the weighted trapezoid graphs (Q2212218) (← links)
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms (Q2632017) (← links)
• The cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• (Q2861561) (← links)
• Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees (Q3100698) (← links)
• Linear Time Optimal Approaches for Max-Profit Inverse 1-Median Location Problems (Q4689388) (← links)
• An algorithm for the Inverse 1-median problem on trees with variable vertex weights and edge reductions (Q4981873) (← links)
• Inverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distance (Q5085261) (← links)
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees (Q5238068) (← 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 max-sum inverse median location problem on trees with budget constraint (Q6095060) (← links)
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (Q6191111) (← links)