Sciweavers

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

13

EOR
2008

favoriteEmaildiscussreport

84views more EOR 2008»

Complexity of local search for the p-median problem

13 years 5 months ago

Complexity of local search for the p-median problem

Download www.math.nsc.ru

For the p-median problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding local search problems are PLS-complete. In the average case we note that standard local descent algorithm is polynomial. A relationship between local optima and 0

Ekaterina Alekseeva, Yury Kochetov, Alexander Plya

Real-time Traffic

Average Case | Corresponding Local Search | EOR 2008 | Local Descent Algorithm |

claim paper

Related Content

» The parameterized complexity of kflip local search for SAT and MAX SAT

» An Improved Integer Local Search for Complex Scheduling Problems

» Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with ...

» Stable Assignment with Couples Parameterized Complexity and Local Search

» Computational complexity analysis of simple genetic programming on two problems modeling i...

» A fast swapbased local search procedure for location problems

» Hybrid Local Search Techniques for the ResourceConstrained Project Scheduling Problem

» Quantum and classical query complexities of local search are polynomially related

» Local Search Algorithms on Graphics Processing Units A Case Study The Permutation Perceptr...

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EOR
Authors	Ekaterina Alekseeva, Yury Kochetov, Alexander Plyasunov

Comments (0)