|
7711
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
5824
|
Introduction to Algorithms
– Cormen, Leiserson, et al.
- 1990
|
|
4827
|
Genetic Algorithms
– Goldberg
- 1989
|
|
2322
|
Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images
– Geman, Geman
- 1984
|
|
2172
|
Optimization by simulated annealing
– Kirkpatrick, Gelatt, et al.
- 1983
|
|
1206
|
Introduction to Parallel Algorithms and Architectures: Arrays
– Leighton
- 1992
|
|
1120
|
Equation of state calculations by fast computing machines
– Metropolis, Rosenbluth, et al.
- 1953
|
|
804
|
Combinatorial Optimization: Algorithms and Complexity
– Papadimitriou, Steiglitz
- 1982
|
|
770
|
An efficient heuristic procedure for partitioning graphs, The Bell Syst
– Kernighan, Lin
- 1970
|
|
690
|
PVM: A framework for parallel distributed computing. Concurrency: Practice and Experience
– Sunderam
- 1990
|
|
436
|
Optimization by Simulated Annealing: An Experimental Evaluation
– Johnson, Aragon, et al.
- 1991
|
|
345
|
Adaptive load sharing in homogeneous distributed systems
– Eager, Lazowska, et al.
- 1986
|
|
300
|
A linear-time heuristic for improving network partitions
– Fiduccia, Mattheyses
- 1982
|
|
291
|
Compiler transformations for high-performance computing
– BACON, GRAHAM, et al.
- 1994
|
|
271
|
Optimization of Control Parameters for Genetic Algorithms
– Grefenstette
- 1986
|
|
262
|
The Steiner Tree Problem
– Hwang, Richards, et al.
- 1992
|
|
248
|
An Effective Heuristic Algorithm for the Traveling Salesman Problem
– Lin, Kernighan
- 1973
|
|
228
|
On the Shortest spanning subtree of a graph and the travelling salesman problem
– Kruskal
|
|
219
|
Introduction to Probability Models
– Ross
- 1980
|
|
207
|
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
– Cerny
- 1985
|
|
201
|
The Travelling Salesman Problem: A Guided Tour of Combinatorial Optimization
– Lawler, Lenstra
- 1985
|
|
197
|
Computer Solutions on the Travelling Salesman Problem
– Lin
- 1965
|
|
195
|
A Taxonomy of Scheduling in General-purpose Distributed Computing Systems
– Casavant, Kuhl
- 1988
|
|
183
|
The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination
– Eshelman
- 1990
|
|
180
|
Distribution and Abstract Types in Emerald
– Black, Hutchinson, et al.
- 1987
|
|
160
|
High Performance Computer Architecture
– Stone
- 1993
|
|
155
|
Performance of dynamic load balancing algorithms for unstructured mesh calculations. Concurrency Practice and Experience
– Williams
- 1991
|
|
152
|
Cooling schedules for optimal annealing
– Hajek
- 1988
|
|
138
|
Local Optimization and the Traveling Salesman Problem
– Johnson
- 1990
|
|
135
|
The Traveling Salesman: Computational Solutions for TSP Applications
– Reinelt
- 1994
|
|
134
|
A portable global optimizer and linker
– Benitez, Davidson
- 1988
|
|
132
|
Np-complete scheduling problems
– Ullman
- 1975
|
|
130
|
Genetic algorithms and simulated annealing
– Davis
- 1987
|
|
122
|
On Steiner’s Problem with Rectilinear Distance,” in VLSI Circuit Layout: Theory and Design,T.C
– Hanan
- 1985
|
|
122
|
Multiprocessor Scheduling with the aid of Network Flow Algorithms
– Stone
- 1977
|
|
121
|
Selection in massively parallel genetic algorithms
– Collins, Jefferson
- 1991
|
|
110
|
Monitors, Message, and Clusters: The p4 Parallel Programming System
– Butler, Lusk
- 1994
|
|
110
|
High Performance Fortran
– Loveman
- 1993
|
|
101
|
Legion: The next logical step toward a nationwide virtual computer
– Grimshaw, Wulf, et al.
- 1994
|
|
93
|
A new class of iterative Steiner tree heuristics with good performance
– Kahng, Robins
- 1992
|
|
91
|
Finite Markov chain analysis of genetic algorithms
– Goldberg, Segrest
- 1987
|
|
88
|
Scheduling parallel program tasks onto arbitrary target machines
– Rewini, Lewis
- 1990
|
|
87
|
Punctuated equilibria: A parallel genetic algorithm
– Cohoon, Hegde, et al.
|
|
83
|
The Timbenvolf placement and routing package
– Sechen, Sangiovanni-Vincentelli
- 1985
|
|
83
|
Determining average program execution times and their variance
– Sarkar
- 1989
|
|
82
|
Scalable load balancing techniques for parallel computers
– Kumar, Crama, et al.
- 1994
|
|
79
|
A Procedure for Placement of Standard-Cell VLSI Circuits
– Dunlop, Kernighan
- 1985
|
|
79
|
The Annealing Algorithm
– Otten, Ginneken
- 1989
|
|
78
|
Easy to Use Object-Oriented Parallel Programming with Mentat
– Grimshaw
- 1993
|
|
77
|
Data-parallel programming on a network of heterogeneous workstations
– Nedeljkovic, Quinn
- 1992
|
|
