Finding groups with maximum betweenness centrality via integer programming with random path sampling.
Tomás LagosOleg A. ProkopyevAlexander VeremyevPublished in: J. Glob. Optim. (2024)
Keyphrases
- integer programming
- shortest path
- betweenness centrality
- np hard
- production planning
- constraint programming
- column generation
- lagrangian relaxation
- set covering
- set covering problem
- linear programming
- cutting plane
- network flow
- integer program
- ai planning
- cutting plane algorithm
- minimum cost
- valid inequalities
- optimal solution
- random walk