New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem.
Dino AhrGerhard ReineltPublished in: ESA (2002)
Keyphrases
- min max
- lower bound
- set of randomly generated instances
- upper bound
- running times
- max min
- multiobjective optimization
- branch and bound
- branch and bound algorithm
- finding optimal solutions
- worst case
- upper and lower bounds
- objective function
- random instances
- max sat
- worst case analysis
- search algorithm
- exact algorithms
- lower bounding
- tabu search algorithm
- optimal solution
- families of valid inequalities
- lower and upper bounds
- genetic algorithm
- online algorithms
- quadratic assignment problem
- heuristic search
- np hard
- computational complexity