A branch-and-price approach with MILP formulation to modularity density maximization on graphs.
Keisuke SatoYoichi IzunagaPublished in: CoRR (2017)
Keyphrases
- mixed integer linear
- mixed integer linear programming
- mathematical programming
- linear program
- objective function
- graph embedding
- cutting plane
- branch and bound algorithm
- graph matching
- mixed integer
- graph structure
- dantzig wolfe
- graph theoretic
- community detection
- graph representation
- graph structures
- random walk
- lower bound
- series parallel
- low density
- neural network