Exploratory blockmodeling for one-mode, unsigned, deterministic networks using integer programming and structural equivalence.
Matthew DabkowskiNeng FanRonald L. BreigerPublished in: Soc. Networks (2016)
Keyphrases
- integer programming
- np hard
- linear programming
- constraint programming
- facility location
- cutting plane
- production planning
- ai planning
- set covering
- column generation
- inference problems
- network flow
- crew scheduling
- set covering problem
- transportation problem
- integer program
- lagrangian relaxation
- cutting plane algorithm
- linear programming relaxation
- network structure
- network design
- network model
- social networks
- vehicle routing problem with time windows
- approximation algorithms
- special case
- round robin tournament