Login / Signup

Lower and upper bounds for the non-linear generalized assignment problem.

Claudia D'AmbrosioSilvano MartelloMichele Monaci
Published in: Comput. Oper. Res. (2020)
Keyphrases
  • lower and upper bounds
  • lower bound
  • upper bound
  • upper and lower bounds
  • lower bounding
  • lagrangian relaxation
  • valid inequalities
  • itemsets
  • ordered sets
  • branch and bound
  • branch and bound algorithm
  • lagrangian dual