A Local Search Heuristic for Biobjective Intersecting Geometric Graphs.
Rajeev KumarPramod Kumar SinghBhargab B. BhattacharyaPublished in: ICCTA (2007)
Keyphrases
- pareto local search
- bi objective
- set covering problem
- neighborhood search
- efficient solutions
- heuristic methods
- set covering
- variable neighborhood search
- multi objective
- graph search
- optimal solution
- multi objective optimization
- integer programming
- branch and bound algorithm
- minimum cost flow
- column generation
- tabu search
- network design
- search algorithm
- ant colony optimization
- multiple objectives
- directed graph
- simulated annealing
- minimum spanning tree
- shortest path problem
- graph theory
- graph databases
- genetic algorithm
- search procedure
- knapsack problem
- job shop scheduling problem
- optimization algorithm
- optimization problems
- evolutionary algorithm
- lower bound
- weighted graph
- combinatorial optimization