Tabu Search for General Zero-One Integer Programs Using the Pivot and Complement Heuristic.
Ronny AboudiKurt JörnstenPublished in: INFORMS J. Comput. (1994)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- integer program
- feasible solution
- heuristic methods
- scheduling problem
- path relinking
- memetic algorithm
- search procedure
- benchmark instances
- job shop scheduling problem
- search algorithm
- iterated local search
- genetic algorithm
- hybrid algorithm
- initial solution
- variable neighborhood search
- vehicle routing problem
- tabu search algorithm
- special case
- flowshop
- column generation
- search heuristics
- quadratic assignment problem
- multidimensional knapsack problem
- cutting plane
- scatter search
- optimization method
- candidate list
- simulated annealing and tabu search
- max sat
- solution quality
- ant colony optimization
- linear programming
- dynamic programming
- optimal solution