Ave Distance Ave distance from other local minima Distance to best local minimum Cost Cost  Home/Search
Context
Related
| ucla.edu/~boese/bvfinal2b.ps.Z ucla.edu/~abk/papers/journal...j15_b.ps ucla.edu/papers/journal/j15_b.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: ucla.edu/~boese/research (more) From: ucla.edu/~abk/publications (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper we address this difficulty with an adaptive multi-start methodology that is based on new insights into global structure of optimization cost surfaces. For instances of the symmetric TSP and graph bisection, we study correlations between the cost of a local minimum and its average distance to all other local minima (as well as its distance to the best-found local minimum). Our analyses show evidence of a "big valley" governing local minima in the optimization cost surface, and... (Update)
Active bibliography (related documents): More All
0.8: Cost Versus Distance In the Traveling Salesman Problem - Boese (1995) (Correct)
0.5: Data Structures for Traveling Salesmen - Fredman, Johnson, McGeoch.. (1995) (Correct)
0.5: The Stochastic Traveling Salesman Problem: Finite Size.. - Percus, Martin (1999) (Correct)
Similar documents based on text: More All
0.1: Lossless Data Compression Via Guided Approximate Bisections - Kieffer, Yang (2000) (Correct)
0.1: Spectral Methods for Bisecting Graphs - Blumofe (1993) (Correct)
0.1: Go with the winners for Graph Bisection - Dimitriou, Impagliazzo (Correct)
BibTeX entry: (Update)
@misc{ distance-,
author = "Ave Distance",
title = ".00 15.00 20.00 25.00 30.00 35.00 40.00 45.00 50.00 55.00 60.00 19.00 20.00
21.00 22.00 10.00 15.00 20.00 25.00 30.00 35.00 40.00 45.00 50.00 55.00
60.00 0.00 5.00 10.00 15.00 20.00 25.00",
url = "citeseer.ist.psu.edu/88201.html" }
Citations (may not include all citations):1527 Optimization by Simulated Annealing - Kirkpatrick, Gelatt et al. - 1983
371 Optimization by Simulated Annealing: An Experimental Evaluat.. (context) - Johnson, Aragon et al. - 1989
283 Random Graphs (context) - Bollobas - 1985
120 A Connectionist Machine for Genetic Hillclimbing (context) - Ackley - 1987
106 The Traveling Salesman Problem: A Guided Tour of Combinatori.. (context) - Lawler, Lenstra et al. - 1985
98 Local Optimization and the Traveling Salesman Problem (context) - Johnson - 1990
90 Correlated and Uncorrelated Fitness Landscapes and How to Te.. (context) - Weinberger - 1990
78 Fast Algorithms for Geometric Traveling Salesman Problems (context) - Bentley - 1992
76 Toward a General Theory of Adaptive Walks on Rugged Landscap.. (context) - Kauffman, Levin - 1987
72 Graph Bisection Algorithms with Good Average Case Behavior (context) - Bui, Chaudhuri et al. - 1987
38 Genetic Local Search Algorithms for the Traveling Salesman P.. (context) - Ulder, Aarts et al. - 1990
22 Evolution Algorithms in Combinatorial Optimization (context) - Muhlenbein, Georges-Schleuter et al. - 1988
15 Efficient Simulated Annealing on Fractal Energy Landscapes (context) - Sorkin - 1991
13 The Complexity of the Lin-Kernighan Heuristic for the Travel.. (context) - Papadimitriou - 1992
12 A Two-Level Two-Way Partitioning Algorithm (context) - Wei, Cheng - 1990
11 Configuration Space Analysis of Traveling Salesman Problems (context) - Kirkpatrick, Toulouse - 1985
8 Towards Practical `Neural' Computation for Combinatorial Opt.. (context) - Baum - 1986
8 personal communication (context) - Sorkin - 1993
8 Configuration Space Analysis for Optimization Problems (context) - Solla, Sorkin et al. - 1986
6 Parallel Genetic Algorithms, Population Genetics and Combina.. (context) - Muhlenbein - 1989
6 Optimization of Globally Convex Functions (context) - Hu, Klee et al. - 1989
5 the Big Valley and Adaptive Multi-Start for Discrete Global .. (context) - Boese, Kahng et al. - 1993
4 Statistical Mechanics and the Travelling Salesman Problem (context) - Sourlas - 1986
4 A Replica Analysis of the Travelling Salesman Problem (context) - Mezard, Parisi - 1986
3 Best-So-Far vs. Where-You-Are: Implications for Optimal Fini.. - Boese, Kahng - 1993
2 Asymptotic Experimental Analysis of the Held-Karp Lower Boun.. (context) - Johnson, Rothberg
1 Ultrametricity, Frustration and the Graph Colouring Problem (context) - Bacci, Parga - 1989
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC