Less Is More: Tabu Search for Bipartite Quadratic Programming Problem.
Dragan UrosevicYiad Ibrahim Yousef AlghoulZhazira AmirgaliyevaNenad MladenovicPublished in: MOTOR (2019)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- scheduling problem
- feasible solution
- memetic algorithm
- hybrid algorithm
- graph model
- heuristic methods
- path relinking
- bipartite graph
- quadratic assignment problem
- computationally efficient
- test problems
- vehicle routing problem
- multidimensional knapsack problem
- genetic algorithm
- search procedure
- job shop scheduling problem
- benchmark instances
- search algorithm
- tabu list
- max sat
- initial solution
- variable neighborhood search
- simulated annealing and tabu search
- multi start
- neural network
- job shop
- tabu search algorithm
- decision trees
- scatter search
- flowshop
- candidate list