Paroids: A Canonical Format for Combinatorial Optimization.
Ronald L. RardinMoises SuditPublished in: Discret. Appl. Math. (1992)
Keyphrases
- combinatorial optimization
- traveling salesman problem
- combinatorial optimization problems
- metaheuristic
- simulated annealing
- branch and bound
- branch and bound algorithm
- optimization problems
- metadata
- mathematical programming
- combinatorial problems
- hard combinatorial optimization problems
- multimedia
- quadratic assignment problem
- max flow min cut
- graph theory
- exact algorithms
- memetic algorithm