Site Navigation
Categories:
Combinatorial optimization
Computational complexity theory
Analysis of algorithms
Summary Of: Combinatorial optimization
When applying standard combinatorial optimization algorithms to this problem...
Encyclodia Page On: Combinatorial optimization
These Are Links To Other Documents
optimization
|
feasible solutions
|
discrete
|
applied mathematics
|
computer science
|
operations research
|
algorithm
|
computational complexity theory
|
artificial intelligence
|
mathematics
|
software engineering
|
Vehicle routing problem
|
Traveling salesman problem
|
Minimum spanning tree
|
Linear programming
|
basic
|
Eight queens puzzle
|
constraint satisfaction problem
|
Knapsack problem
|
metaheuristic
|
Local search
|
Simulated annealing
|
Quantum annealing
|
GRASP
|
Swarm intelligence
|
Tabu search
|
Genetic algorithms
|
Ant colony optimization
|
Reactive search
|
Bees algorithm
|
Hopfield net
|
Self-organizing map
|
Discrete optimization
|
Search algorithm
|
Brute-force search
|
No free lunch in search and optimization
|
ISBN 0-471-55894-X
|
Marek Karpinski
|
Kenneth Steiglitz
|
ISBN 0-486-40258-4
|
Categories
|
Combinatorial optimization
|
Computational complexity theory
|
Analysis of algorithms
|
This article is licensed under the
GNU Free Documentation License
. It uses material from the
Wikipedia article "Combinatorial optimization"
.
