Lower bound sets for biobjective shortest path problems.
Enrique MachucaLawrence MandowPublished in: J. Glob. Optim. (2016)
Keyphrases
- shortest path problem
- bi objective
- lower bound
- shortest path
- upper bound
- multiple objectives
- combinatorial optimization problems
- minimum cost flow
- set covering problem
- branch and bound
- directed graph
- efficient solutions
- branch and bound algorithm
- optimal solution
- shortest path algorithm
- lower and upper bounds
- multi objective
- objective function
- lagrangian relaxation
- max sat
- directed acyclic graph
- metaheuristic
- linear programming