Solutions of combinatorial problems using generating functions on a variable-field computer.
Gerald M. WeinbergPublished in: Commun. ACM (1964)
Keyphrases
- combinatorial problems
- constraint programming
- metaheuristic
- graph coloring
- constraint satisfaction
- constraint satisfaction problems
- combinatorial optimization
- traveling salesman problem
- branch and bound algorithm
- phase transition
- combinatorial search
- solving hard
- global constraints
- specific problems
- graph colouring
- hard combinatorial optimization problems
- ant colony optimization
- simulated annealing
- constraint propagation
- optimal solution
- search strategies
- symmetry breaking
- special case
- maximum satisfiability
- search space