Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem.
János BartaValeria LeggieriRoberto MontemanniPaolo NobiliChefi TrikiPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- valid inequalities
- integer programming
- traveling salesman problem
- mixed integer linear programs
- linear programming
- cutting plane algorithm
- mixed integer programming
- cutting plane
- mixed integer
- linear programming relaxation
- lower and upper bounds
- convex hull
- network design problem
- column generation
- feasible solution
- integer programming formulation
- primal dual
- generative model
- probabilistic model
- facet defining inequalities
- continuous variables
- facet defining
- bayesian networks
- integer program
- lagrangian relaxation
- linear program
- multistage
- dynamic programming
- evolutionary algorithm
- lower bound