Solving hard set covering problems.
Carlo ManninoAntonio SassanoPublished in: Oper. Res. Lett. (1995)
Keyphrases
- solving hard
- set covering problem
- combinatorial problems
- branch and bound algorithm
- search problems
- satisfiability problem
- column generation
- set covering
- constraint programming
- stochastic local search
- integer programming
- propositional logic
- propositional satisfiability
- bi objective
- branch and bound
- lower bound
- sat problem
- combinatorial optimization
- upper bound
- optimal solution
- randomly generated
- np hard
- search algorithm
- constraint satisfaction problems
- orders of magnitude
- phase transition
- search space
- metaheuristic
- constraint satisfaction
- search strategies
- search tree
- np complete
- multi objective
- sat solvers
- traveling salesman problem
- efficient solutions
- integer program
- worst case
- state space