Circular coloring of graphs via linear programming and tabu search.
Mate BaranyZsolt TuzaPublished in: Central Eur. J. Oper. Res. (2015)
Keyphrases
- tabu search
- linear programming
- feasible solution
- simulated annealing
- metaheuristic
- path relinking
- search procedure
- scheduling problem
- vehicle routing problem
- linear program
- heuristic methods
- genetic algorithm
- memetic algorithm
- job shop scheduling problem
- tabu search algorithm
- test problems
- max sat
- initial solution
- iterated local search
- quadratic assignment problem
- mathematical programming
- hybrid algorithm
- column generation
- tabu list
- np hard
- optimal solution
- scatter search
- benchmark instances
- objective function
- graph theory
- integer programming
- variable neighborhood search
- dynamic programming
- test instances
- weighted graph
- graph structure
- constraint satisfaction
- multi start
- shortest path
- candidate list