Integer programming models for detecting graph bipartitions with structural requirements.
Chrysafis VogiatzisJose L. WalterosPublished in: Networks (2018)
Keyphrases
- integer programming
- column generation
- np hard
- set covering problem
- linear programming
- production planning
- cutting plane algorithm
- vehicle routing problem with time windows
- transportation problem
- lagrangian relaxation
- ai planning
- constraint programming
- network flow
- integer program
- valid inequalities
- dynamic programming
- support vector