Pages that link to "Item:Q941835"

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

Displaying 15 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)