Using Weighted-Sum Functions to Compute Nonsupported Efficient solutions in multiobjective Combinatorial-{0, 1} Problems.
Carlos Gomes da SilvaJoão C. N. ClímacoPublished in: Int. J. Inf. Technol. Decis. Mak. (2013)
Keyphrases
- weighted sum
- efficient solutions
- combinatorial problems
- multi objective
- bi objective
- objective function
- pareto optimal solutions
- optimal solution
- metaheuristic
- constraint programming
- traveling salesman problem
- constraint satisfaction problems
- bicriteria
- combinatorial optimization
- branch and bound algorithm
- constraint satisfaction
- linear combination
- phase transition
- multi objective optimization
- multiobjective optimization
- evolutionary algorithm
- global constraints
- heuristic methods
- optimization algorithm
- optimization problems
- set covering problem
- particle swarm optimization
- lower bound
- genetic algorithm
- ant colony optimization
- nsga ii
- multiple objectives
- weight function
- np hard
- search space
- linear programming
- simulated annealing
- upper bound
- image segmentation