Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming.
Neng FanJean-Paul WatsonPublished in: COCOA (2012)
Keyphrases
- integer programming
- dominating set
- connected dominating set
- facility location problem
- facility location
- integer program
- np hard
- ai planning
- lagrangian relaxation
- linear programming
- cutting plane
- column generation
- set partitioning
- set covering
- network flow
- constraint programming
- lp relaxation
- approximation algorithms
- valid inequalities
- vehicle routing problem with time windows
- cutting plane algorithm
- exact methods
- bayesian networks
- constraint satisfaction problems
- network design
- exact solution
- supply chain