Sciweavers

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

7

SODA
2004
ACM

favoriteEmaildiscussreport

89views Algorithms» more SODA 2004»

Approximate local search in combinatorial optimization

13 years 6 months ago

Approximate local search in combinatorial optimization

Download web.mit.edu

srn.com/abstract=423560

James B. Orlin, Abraham P. Punnen, Andreas S. Schu

Real-time Traffic

Algorithms | SODA 2004 |

claim paper

Related Content

» Genetic local search for multiobjective combinatorial optimization

» DepthFirst BranchandBound versus Local Search A Case Study

» An Iterated Local Search Approach for Minimum SumofSquares Clustering

» Speedup techniques for solving largescale bTSP with the TwoPhase Pareto Local Search

» A Hybrid of Inference and Local Search for Distributed Combinatorial Optimization

» Local Optima Networks of the Quadratic Assignment Problem

» Parallel Search for Combinatorial Optimization Genetic Algorithms Simulated Annealing Tabu...

» Local search for distributed asymmetric optimization

» Adaptive local ratio

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	James B. Orlin, Abraham P. Punnen, Andreas S. Schulz

Comments (0)