Project PB9J-0787-Koala and CIRIT 1997SGR-00366. The implementation and evaluation of these heuristics has been done at the C 4 (Centre de Computaci'o i Comunicacions de Catalunya). 1
|
2172
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
1120
|
Equation of state calculations by fast computing machines
– Metropolis, Rosenbluth, et al.
- 1953
|
|
436
|
Optimization by Simulated Annealing: An Experimental Evaluation
– Johnson, Aragon, et al.
- 1991
|
|
304
|
Some simplified NP-complete graph problems
– Garey, Johnson, et al.
- 1976
|
|
85
|
Divide-and-Conquer Approximation Algorithms via Spreading Metrics
– Even, Naor, et al.
|
|
83
|
Spectral partitioning works: planar graphs and finite element meshes, FOCS
– Spielman, Teng
- 1996
|
|
82
|
The regularity lemma and approximation schemes for dense problems
– Frieze, Kannan
- 1996
|
|
75
|
The Chaco user's guide
– Leland
|
|
48
|
Optimal Linear Ordering
– Adolphson, Hu
- 1973
|
|
48
|
Optimal linear labellings and eigenvalues of graphs
– Juvan, Mohar
- 1992
|
|
36
|
Simulated annealing for graph bisection
– Jerrum, Sorkin
- 1993
|
|
36
|
New Approximation Techniques for Some Ordering Problems
– Rao, Richa
|
|
35
|
Linear layouts of generalized hypercubes
– Nakano
- 1993
|
|
34
|
Estimating the largest eigenvalue with the Lanczos algorithm
– Parlett, Simon, et al.
- 1982
|
|
23
|
A minimum linear arrangement algorithm for undirected trees
– SHILOACH
- 1979
|
|
22
|
Parallel algorithms for chip placement by simulated annealing
– Darema, Kirkpatrick, et al.
- 1987
|
|
18
|
Approximation heuristics and benchmarkings for the MinLA problem
– Petit
- 1998
|
|
13
|
Optimal numberings of an n \Theta n array
– Mitchison, Durbin
- 1986
|
|
8
|
A General Purpose Distributed Implementation of Simulated Annealing
– Diekmann, Lüling, et al.
- 1992
|
|
7
|
Approximating layout problems on random sparse graphs
– D'iaz, Petit, et al.
- 1998
|
|
6
|
Parallel algorithms for the minimum cut and the minimum length tree layout problems. Theoretical Computer Science
– D'iaz, Gibbons, et al.
- 1997
|
|
6
|
Generating lower bounds for the linear arrangement problem
– Liu, Vannelli
- 1995
|
|
5
|
The Effect of the density of states on the Metropolis algorithm
– Sasaki
- 1991
|
|
3
|
Coloring in sublinear time
– Nolte, Schrader
- 1997
|
|
2
|
Chassis layout and isoperimeter problems
– Harper
- 1972
|
|
