ConsNet - A tabu search approach to the spatially coherent conservation area network design problem.
Michael CiarleglioJ. Wesley BarnesSahotra SarkarPublished in: J. Heuristics (2010)
Keyphrases
- tabu search
- network design problem
- feasible solution
- lagrangian relaxation
- branch and bound
- simulated annealing
- search algorithm
- minimal cost
- metaheuristic
- mixed integer
- network design
- approximation algorithms
- valid inequalities
- scheduling problem
- transportation networks
- mixed integer programming
- path relinking
- heuristic methods
- genetic algorithm
- integer programming
- tabu search algorithm
- vehicle routing problem
- solution quality
- job shop scheduling problem
- search space
- branch and bound algorithm
- combinatorial optimization
- special case
- combinatorial optimization problems
- video sequences
- traveling salesman problem
- np hard
- bayesian networks