Login / Signup

Improving the efficiency of the Branch and Bound algorithm for integer programming based on "flatness" information.

Iván DerpichJorge R. Vera
Published in: Eur. J. Oper. Res. (2006)
Keyphrases
  • integer programming
  • branch and bound algorithm
  • np hard
  • linear programming
  • set covering problem
  • optimization problems
  • combinatorial optimization
  • constraint programming
  • lagrangian relaxation