Integer programming approach to static monopolies in graphs.
Babak MoazzezHossein SoltaniPublished in: J. Comb. Optim. (2018)
Keyphrases
- integer programming
- np hard
- column generation
- linear programming
- constraint programming
- lagrangian relaxation
- cutting plane algorithm
- ai planning
- dynamic graph
- facility location
- network flow
- production planning
- cutting plane
- set covering problem
- set covering
- linear programming relaxation
- vehicle routing problem with time windows
- integer program
- valid inequalities
- transportation problem
- bipartite graph
- inference problems
- bayesian networks
- dantzig wolfe decomposition
- np complete
- special case
- evolutionary algorithm