Non-classical preference models in combinatorial problems: Models and algorithms for graphs.
Olivier SpanjaardPublished in: 4OR (2004)
Keyphrases
- combinatorial problems
- constraint programming
- combinatorial optimization
- constraint satisfaction
- constraint satisfaction problems
- metaheuristic
- graph colouring
- solving hard
- orders of magnitude
- decision making
- branch and bound algorithm
- phase transition
- simulated annealing
- multi dimensional
- worst case
- cost function
- graph coloring
- special case
- computational complexity