On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design.
Michael R. FellowsMichael A. LangstonPublished in: SIAM J. Discret. Math. (1992)
Keyphrases
- partial order
- combinatorial problems
- vlsi design
- constraint programming
- partially ordered
- total order
- constraint satisfaction problems
- metaheuristic
- constraint satisfaction
- combinatorial optimization
- traveling salesman problem
- phase transition
- design methodology
- branch and bound algorithm
- np complete
- totally ordered
- global constraints
- search algorithm
- causal links
- preference relations
- constraint propagation
- ant colony optimization
- optimization problems
- upper bound
- search space