Mixed Integer Programming and LP Rounding for Opinion Maximization on Directed Acyclic Graphs.
Po-An ChenYa-Wen ChengYao-Wei TsengPublished in: COMPLEX NETWORKS (2021)
Keyphrases
- mixed integer programming
- directed acyclic graph
- mixed integer
- linear programming relaxation
- linear programming
- linear program
- column generation
- valid inequalities
- objective function
- feasible solution
- equivalence class
- lot sizing
- lagrangian relaxation
- random variables
- equivalence classes
- structural learning
- optimal solution
- directed graph
- convex hull
- conditional independence
- causal models
- cutting plane
- continuous variables
- production planning
- probability distribution
- integer programming
- upper bound
- np hard