MinSAT versus MaxSAT for Optimization Problems.
Josep ArgelichChu Min LiFelip ManyàZhu ZhuPublished in: CP (2013)
Keyphrases
- optimization problems
- combinatorial optimization problems
- combinatorial optimization
- branch and bound algorithm
- metaheuristic
- unsatisfiable cores
- evolutionary algorithm
- boolean satisfiability
- sat problem
- knapsack problem
- traveling salesman problem
- sat solvers
- objective function
- combinatorial problems
- benchmark problems
- branch and bound
- cost function
- upper bound
- maximum satisfiability
- max sat
- nonlinear programming
- ant colony optimization
- satisfiability problem
- randomly generated
- practical problems
- simulated annealing
- hidden structure
- search algorithm
- lower bound
- combinatorial auctions
- orders of magnitude
- special case
- sat instances
- phase transition
- vehicle routing problem
- genetic algorithm
- multi objective