Pages that link to "Item:Q1304521"

The following pages link to An \(O(mn)\) algorithm for the 1-maximin problem on a network (Q1304521):

Displaying 9 items.

• Undesirable facility location problems on multicriteria networks (Q853902) (← links)
• An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
• Network location of a reliable center using the most reliable route policy (Q960392) (← links)
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
• Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives (Q2253362) (← links)
• The Voronoi Partition of a Network and Its Implications in Location Theory (Q4024312) (← links)
• An <formula formulatype="inline"><tex Notation="TeX">$O(1/k)$</tex> </formula> Gradient Method for Network Resource Allocation Problems (Q5358406) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)
• Solving of the maxisum location problem on network with a restriction on transport costs (Q6081727) (← links)