Solving diameter-constrained minimum spanning tree problems by constraint programming.
Thiago F. NoronhaCelso C. RibeiroAndréa C. SantosPublished in: Int. Trans. Oper. Res. (2010)
Keyphrases
- constraint programming
- combinatorial problems
- constraint problems
- finite domain
- search heuristics
- minimum spanning tree
- np hard problems
- constraint satisfaction problems
- constraint solvers
- solving problems
- constraint optimization
- constraint propagation
- constraint satisfaction
- graph coloring
- propositional satisfiability
- search algorithm
- combinatorial optimization
- global constraints
- spanning tree
- hard and soft constraints
- traveling salesman problem
- machine learning or data mining
- constraint solver
- soft constraints
- search strategies
- optimization problems