Login / Signup
Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem.
Christian Prins
Caroline Prodhon
Roberto Wolfler Calvo
Published in:
Ann. Oper. Res. (2006)
Keyphrases
</>
bi objective
set covering problem
dynamic programming
neural network
computational efficiency
lagrangian relaxation
objective function
lower bound
cost function
optimization algorithm
branch and bound algorithm
integer programming