A Lagrangian bounding and heuristic principle for bi-objective discrete optimization.
Torbjörn LarssonNils-Hassan QuttinehIda ÅkerholmPublished in: Oper. Res. (2024)
Keyphrases
- discrete optimization
- bi objective
- combinatorial optimization problems
- optimal solution
- knapsack problem
- set covering problem
- efficient solutions
- shortest path problem
- multi objective
- ant colony optimization
- combinatorial optimization
- lagrangian relaxation
- metaheuristic
- heuristic methods
- multiple objectives
- multi objective optimization
- upper bound
- network design
- tabu search
- lower bound
- dynamic programming
- nsga ii
- search algorithm
- search strategies
- neural network
- routing problem
- pattern recognition
- simulated annealing
- branch and bound algorithm
- objective function
- np hard
- solution quality
- optimization problems
- greedy algorithm
- network architecture
- graph matching
- feasible solution
- traveling salesman problem
- similarity measure