Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

SODA
1998
ACM

favoriteEmaildiscussreport

86views Algorithms» more SODA 1998»

Analysis of a Local Search Heuristic for Facility Location Problems

13 years 6 months ago

Analysis of a Local Search Heuristic for Facility Location Problems

Download domino.research.ibm.com

Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Ra

Real-time Traffic

Algorithms | SODA 1998 |

claim paper

Related Content

» Price of Anarchy Locality Gap and a Network Service Provider Game

» STFLS A Heuristic Method for Static and Transportation Facility Location Allocation in Lar...

» A 3Approximation for Facility Location with Uniform Capacities

» Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facilit...

» Facility location with hierarchical facility costs

» Computing Approximate Solutions of the Maximum Covering Problem with GRASP

» A fast swapbased local search procedure for location problems

» Hybrid heuristics for the probabilistic maximal covering locationallocation problem

» Randomized Local Search Evolutionary Algorithms and the Minimum Spanning Tree Problem

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	SODA
Authors	Madhukar R. Korupolu, C. Greg Plaxton, Rajmohan Rajaraman

Comments (0)