Adapting Exact and Heuristic Procedures in Solving an NP-Hard Sequencing Problem.
Andreas WiehlPublished in: OR (2014)
Keyphrases
- np hard
- exact methods
- optimal solution
- greedy heuristic
- search heuristics
- randomly generated problem instances
- exact solution
- special case
- finding an optimal solution
- combinatorial optimization
- branch and bound algorithm
- lower bound
- lagrangian relaxation
- dynamic programming
- scheduling problem
- approximate solutions
- timetabling problem
- mixed integer program
- tabu search
- knapsack problem
- approximation algorithms
- linear programming
- exact algorithms
- variable ordering
- branch and bound search
- np hardness
- strongly np hard
- heuristic methods
- search procedures
- integer programming
- linear program
- greedy algorithm
- search algorithm
- beam search
- objective function
- computationally hard
- constraint programming
- worst case
- upper bound
- constant factor approximation
- remains np hard
- sliding tile