Login / Signup

Using diversification, communication and parallelism to solve mixed-integer linear programs.

Rodolfo CarvajalShabbir AhmedGeorge L. NemhauserKevin C. FurmanVikas GoelYufen Shao
Published in: Oper. Res. Lett. (2014)
Keyphrases
  • mixed integer linear programs
  • continuous relaxation
  • cutting plane algorithm
  • linear programming
  • knapsack problem
  • upper bound
  • graphical models
  • tabu search
  • random variables
  • integer variables