Branch-and-bound algorithms for solving hard instances of the one-machine sequencing problem.
Yunpeng PanLeyuan ShiPublished in: Eur. J. Oper. Res. (2006)
Keyphrases
- solving hard
- branch and bound algorithm
- combinatorial problems
- backtrack search
- randomly generated
- stochastic local search
- lower bound
- branch and bound
- propositional satisfiability
- combinatorial optimization
- max sat
- satisfiability problem
- graph coloring
- search problems
- optimal solution
- upper bound
- boolean satisfiability
- np hard
- constraint programming
- sat problem
- constraint satisfaction
- propositional logic
- sat instances
- metaheuristic
- sat solvers
- search tree
- constraint satisfaction problems
- np complete
- set covering problem
- neural network
- traveling salesman problem
- search strategies
- tree search
- orders of magnitude
- heuristic search