Exact Methods for Computing All Lorenz Optimal Solutions to Biobjective Problems.

Lucie Galand Thibaut Lust

Published in: ADT (2015)

Keyphrases

efficient solutions
bi objective
optimal solution
exact methods
heuristic methods
set covering problem
branch and bound algorithm
minimum cost flow
lower bound
approximate solutions
np hard
combinatorial problems
decision problems
minimum cost
shortest path problem
metaheuristic
np complete
optimization problems