An integer programming approach for finding the most and the least central cliques.
Chrysafis VogiatzisAlexander VeremyevEduardo L. PasiliaoPanos M. PardalosPublished in: Optim. Lett. (2015)
Keyphrases
- integer programming
- np hard
- linear programming
- ai planning
- lagrangian relaxation
- constraint programming
- column generation
- network flow
- inference problems
- facility location
- integer program
- set covering
- transportation problem
- production planning
- set covering problem
- cutting plane algorithm
- valid inequalities
- cutting plane
- vehicle routing problem with time windows
- crew scheduling
- linear programming relaxation
- search algorithm
- layout design
- set partitioning
- optimal solution