Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization.
Jochen GorskiKathrin KlamrothStefan RuzikaPublished in: J. Optim. Theory Appl. (2011)
Keyphrases
- combinatorial optimization
- efficient solutions
- multiple objectives
- bi objective
- multi objective
- bicriteria
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- optimal solution
- simulated annealing
- branch and bound
- branch and bound algorithm
- combinatorial problems
- multi objective optimization
- optimization problems
- knapsack problem
- linear programming problems
- pareto optimal
- mathematical programming
- objective function
- heuristic methods
- set covering problem
- shortest path problem
- hard combinatorial optimization problems
- optimization algorithm
- job shop scheduling problem
- multiobjective optimization
- single machine scheduling problem
- nsga ii
- vehicle routing problem
- exact algorithms
- decision variables
- fitness function
- upper bound
- genetic algorithm