A Primal Decomposition Method with Suboptimality Bounds for Distributed Mixed-Integer Linear Programming.
Andrea CamisaIvano NotarnicolaGiuseppe NotarstefanoPublished in: CoRR (2018)
Keyphrases
- decomposition method
- mixed integer linear programming
- lower bound
- branch and bound algorithm
- cutting plane
- decomposition methods
- decomposition algorithm
- linear programming
- linear program
- mathematical programming
- upper bound
- optimal solution
- support vector
- production planning
- mixed integer
- mixed integer nonlinear programming
- np hard
- optimal control
- worst case
- learning algorithm