Approximating a class of combinatorial problems with rational objective function.
José R. CorreaCristina G. FernandesYoshiko WakabayashiPublished in: Math. Program. (2010)
Keyphrases
- combinatorial problems
- objective function
- constraint programming
- combinatorial optimization
- graph coloring
- metaheuristic
- phase transition
- constraint satisfaction problems
- traveling salesman problem
- constraint satisfaction
- combinatorial search
- solving hard
- optimization problems
- optimal solution
- branch and bound algorithm
- neural network
- specific problems
- boolean satisfiability
- orders of magnitude
- global constraints
- multi objective
- lower bound