Pages that link to "Item:Q326486"

The following pages link to The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance (Q326486):

Displaying 27 items.

• Inverse 1-median problem on block graphs with variable vertex weights (Q283940) (← links)
• The inverse connected \(p\)-median problem on block graphs under various cost functions (Q827099) (← links)
• On the complexity of inverse convex ordered 1-median problem on the plane and on tree networks (Q1616830) (← links)
• Reverse selective obnoxious center location problems on tree graphs (Q1650850) (← 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)
• 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)
• 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)
• Inverse anti-\(k\)-centrum problem on networks with variable edge lengths (Q1988619) (← links)
• Inverse minimum flow problem under the weighted sum-type Hamming distance (Q2012059) (← links)
• Inverse group 1-median problem on trees (Q2031325) (← links)
• Constrained inverse minimum flow problems under the weighted Hamming distance (Q2049978) (← links)
• Inverse single facility location problem on a tree with balancing on the distance of server to clients (Q2076390) (← links)
• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance (Q2240118) (← links)
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance (Q2279743) (← links)
• Inverse 1-median problem on trees under mixed rectilinear and Chebyshev norms (Q2330101) (← 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 cardinality constrained inverse center location problems on tree networks with edge length augmentation (Q2661775) (← links)
• Upgrading edges in the maximal covering location problem (Q2673553) (← links)
• Linear time optimal approaches for reverse obnoxious center location problems on networks (Q2836087) (← links)
• Speedup the optimization of maximal closure of a node-weighted directed acyclic graph (Q6105899) (← links)
• Inverse vertex/absolute quickest 1-center location problem on a tree under weighted \(l_1\) norm (Q6191111) (← links)