Back to search

Total Citations Per Year

Abstract

References (69)

Computers and Intractability: A Guide to the Theory of NP-Completeness

1979 • 45,565 citations

Optimization by Simulated Annealing

1983 • 42,775 citations

Some methods for classification and analysis of multivariate observations

1967 • 21,217 citations

Pattern Recognition with Fuzzy Objective Function Algorithms

1981 • 16,682 citations

THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS

1936 • 14,013 citations

Genetic Programming: On the Programming of Computers by Means of Natural Selection

1992 • 13,426 citations

The Logic of Scientific Discovery.

1959 • 7,547 citations

A Fuzzy Relative of the ISODATA Process and Its Use in Detecting Compact Well-Separated Clusters

1973 • 6,289 citations

Tabu Search

1997 • 5,915 citations

Tabu Search—Part II

1990 • 5,665 citations

Cluster Analysis for Applications

1973 • 5,277 citations

Tabu Search—Part I

1989 • 4,603 citations

A Rapidly Convergent Descent Method for Minimization

1963 • 4,529 citations

An Effective Heuristic Algorithm for the Traveling-Salesman Problem

1973 • 3,730 citations

Characterization of molecular branching

1975 • 3,429 citations

Modern heuristic techniques for combinatorial problems

1993 • 2,671 citations

Greedy Randomized Adaptive Search Procedures

2006 • 2,392 citations

TSPLIB—A Traveling Salesman Problem Library

1991 • 2,385 citations

Local Search in Combinatorial Optimization

2003 • 2,118 citations

OR-Library: Distributing Test Problems by Electronic Mail

1990 • 1,825 citations

The Cutting-Plane Method for Solving Convex Programs

1960 • 1,530 citations

Resource-constrained project scheduling: Notation, classification, models, and methods

1999 • 1,477 citations

NP-complete scheduling problems

1975 • 1,365 citations

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

1998 • 1,178 citations

A Dual-Based Procedure for Uncapacitated Facility Location

1978 • 922 citations

The Steiner Tree Problem

1992 • 889 citations

Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

1968 • 795 citations

Solving mixed integer nonlinear programs by outer approximation

1994 • 643 citations

Metaheuristics: A bibliography

1996 • 632 citations

Efficient Implementation of the Fuzzy c-Means Clustering Algorithms

1986 • 616 citations

Cluster analysis and mathematical programming

1997 • 606 citations

New Insertion and Postoptimization Procedures for the Traveling Salesman Problem

1992 • 513 citations

Heuristic Algorithms for the Resource-Constrained Project Scheduling Problem: Classification and Computational Analysis

1999 • 504 citations

Fast Algorithms for Geometric Traveling Salesman Problems

1992 • 468 citations

Capacitated Lot Sizing with Setup Times

1989 • 447 citations

Variable neighborhood search for the p-median

1997 • 385 citations

Algorithms for the maximum satisfiability problem

1990 • 345 citations

An Introduction to Variable Neighborhood Search

1999 • 335 citations

A Nonlinear Programming Technique for the Optimization of Continuous Processing Systems

1961 • 334 citations

Local search in combinatorial optimization

1995 • 309 citations

Bison: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem

1997 • 284 citations

On conjectures of Graffiti

1988 • 275 citations

Numerical Experience with Lower Bounds for MIQP Branch-And-Bound

1998 • 215 citations

A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems

1983 • 183 citations

Crew pairing at Air France

1997 • 179 citations

Multidimensional group analysis

1966 • 178 citations

A Hybrid Tabu Search Algorithm for the Nurse Rostering Problem

1999 • 176 citations

Efficient Scheduling of Arbitrary Task Graphs to Multiprocessors Using a Parallel Genetic Algorithm

1997 • 160 citations

Intensification and diversification with elite tabu search solutions for the linear ordering problem

1999 • 159 citations

A note on solving large p-median problems

1985 • 155 citations

Weighted k‐cardinality trees: Complexity and polyhedral structure

1994 • 114 citations

A view of local search in constraint programming

1996 • 95 citations

Capacitated lot-sizing and scheduling by Lagrangean relaxation

1992 • 88 citations

Adaptive memories for the Quadratic Assignment Problems

1997 • 87 citations

Approximate solution of weighted MAX-SAT problems using GRASP

1997 • 81 citations

The Traveling Salesman Problem with Backhauls

1996 • 71 citations

A Variable Neighbourhood Algorithm for Solving the Continuous Location-Allocation Problem

1995 • 68 citations

Multiprocessor scheduling in a genetic paradigm

1996 • 67 citations

Improvements and Comparison of Heuristics for solving the Multisource Weber Problem

1997 • 64 citations

Dynamic tabu search strategies for the traveling purchaser problem

1996 • 58 citations

A method of a spread-spectrum radar polyphase code design

1990 • 57 citations

Chapter 7 Location on networks

1995 • 49 citations

Optimal cutwidths and bisection widths of 2- and 3-dimensional meshes

1995 • 34 citations

Heuristics for the K-Cardinality Tree and Subgraph Problems

1996 • 30 citations

Variable Neighborhood Search for Extremal Graphs. 4. Chemical Trees with Extremal Connectivity Index

1998 • 30 citations

Some Bounds for the Connectivity Index of a Chemical Graph

1998 • 29 citations

Heuristics for backplane ordering

1987 • 9 citations

Generalized Fuzzy Kohonen Clustering Networks

1998 • 4 citations

Deleted Work

1955 • 0 citations

Cited By (0)

Loading...