An integer programming-based local search for the covering salesman problem.
Majid SalariZahra Naji AzimiPublished in: Comput. Oper. Res. (2012)
Keyphrases
- integer programming
- np hard
- linear programming
- search space
- constraint programming
- column generation
- search algorithm
- ai planning
- global search
- integer program
- network flow
- production planning
- memetic algorithm
- tabu search
- cutting plane
- optimal solution
- lagrangian relaxation
- combinatorial optimization
- simulated annealing
- valid inequalities
- linear programming relaxation
- set covering problem
- facility location
- vehicle routing problem with time windows
- search strategies
- cutting plane algorithm
- inference problems
- search procedure
- transportation problem
- metaheuristic
- integer programming formulations