Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutions.
Britta SchulzeKathrin KlamrothMichael StiglmayrPublished in: J. Glob. Optim. (2019)
Keyphrases
- combinatorial optimization
- multi objective
- combinatorial optimization problems
- combinatorial problems
- metaheuristic
- vehicle routing problem
- hard combinatorial optimization problems
- test instances
- objective function
- benchmark problems
- traveling salesman problem
- particle swarm optimization
- simulated annealing
- evolutionary algorithm
- lower bound
- constraint programming
- mathematical programming
- combinatorial search
- genetic algorithm
- simulated annealing and tabu search