Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications.
Michel MinouxPublished in: Math. Program. (1989)
Keyphrases
- min max
- combinatorial problems
- combinatorial optimization
- solving hard
- graph coloring
- constraint programming
- min sum
- traveling salesman problem
- constraint satisfaction problems
- multiobjective optimization
- metaheuristic
- constraint satisfaction
- sat encodings
- phase transition
- branch and bound algorithm
- global constraints
- multiple objectives
- simulated annealing
- mathematical programming
- neural network
- search problems
- optimization problems
- stochastic local search
- finite domain
- np hard
- linear programming
- decision makers
- markov random field
- multi objective
- optimal solution