A finite-time cutting plane algorithm for distributed mixed integer linear programming.

Andrea Testa Alessandro Rucco Giuseppe Notarstefano

Published in: CDC (2017)

Keyphrases

cutting plane
mixed integer linear programming
cutting plane algorithm
integer programming
column generation
lower bound
valid inequalities
knapsack problem
mixed integer
integer program
mathematical programming
max flow
branch and bound algorithm
linear program
computationally expensive
np complete
upper bound