Experimental Supplements to the Theoretical Analysis of EAs on Problems from Combinatorial Optimization.
Patrick BriestDimo BrockhoffBastian DegenerMatthias EnglertChristian GuniaOliver HeeringThomas JansenMichael LeifhelmKai PlociennikHeiko RöglinAndrea SchweerDirk SudholtStefan TannenbaumIngo WegenerPublished in: PPSN (2004)
Keyphrases
- combinatorial optimization
- theoretical analysis
- combinatorial optimization problems
- optimization problems
- evolutionary algorithm
- combinatorial problems
- metaheuristic
- traveling salesman problem
- simulated annealing
- mathematical programming
- branch and bound
- exact algorithms
- branch and bound algorithm
- hard combinatorial optimization problems
- combinatorial search
- np complete
- ant colony optimization
- lower bound
- multiscale
- computer vision