A mixed integer linear program and tabu search approach for the complementary edge covering problem.
Ali Naimi SadighMarzieh MozafariAli Husseinzadeh KashanPublished in: Adv. Eng. Softw. (2010)
Keyphrases
- tabu search
- mixed integer linear program
- feasible solution
- simulated annealing
- metaheuristic
- scheduling problem
- path relinking
- linear program
- solution quality
- memetic algorithm
- vehicle routing problem
- job shop scheduling problem
- mixed integer
- heuristic methods
- search procedure
- multidimensional knapsack problem
- genetic algorithm
- search algorithm
- weighted graph
- scatter search
- iterated local search
- optimal solution
- hybrid algorithm
- mixed integer linear programming
- initial solution
- variable neighborhood search
- tabu list
- linear programming
- candidate list