Pages that link to "Item:Q3799815"

The following pages link to Probabilistic Analysis of a Relaxation for the <i>k</i>-Median Problem (Q3799815):

Displaying 17 items.

• A note on duality gap in the simple plant location problem (Q858326) (← links)
• A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
• A projection method for the uncapacitated facility location problem (Q918404) (← links)
• Probabilistic analysis of two \(k\)-cluster problems (Q1324688) (← links)
• Fast bounding procedures for large instances of the simple plant location problem (Q1762067) (← links)
• Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← links)
• A probabilistic analysis of the maximal covering location problem (Q1801679) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• The almost surely shrinking yolk (Q2270336) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• An aggressive reduction scheme for the simple plant location problem (Q2514768) (← links)
• Probabilistic analysis of optimization problems on generalized random shortest path metrics (Q2662688) (← links)
• An ex-post bound on the greedy heuristic for the uncapacitated facility location problem (Q3411298) (← links)
• Approximability results for the $p$-centdian and the converse centdian problems (Q6045453) (← links)
• Agile optimization for a real‐time facility location problem in Internet of Vehicles networks (Q6065907) (← links)