A Weighted and Epsilon-Constraint Biased-Randomized Algorithm for the Biobjective TOP with Prioritized Nodes.
Lucia Agud-AlbesaNeus GarridoAngel A. JuanAlmudena LlorensSandra Oltra-CrespoPublished in: Comput. (2024)
Keyphrases
- randomized algorithm
- bi objective
- greedy algorithm
- minimum cost flow
- efficient solutions
- multi objective
- shortest path
- lower bound
- shortest path problem
- weighted graph
- set covering problem
- multi objective optimization
- multiple objectives
- ant colony optimization
- directed graph
- network design
- shortest path algorithm
- weighted sum
- minimum cost
- knapsack problem
- sample complexity
- upper bound