Applying Convex Integer Programming: Sum Multicoloring and Bounded Neighborhood Diversity.
Tomas GavenciakDusan KnopMartin KouteckýPublished in: CoRR (2017)
Keyphrases
- integer programming
- linear programming
- np hard
- column generation
- production planning
- ai planning
- lagrangian relaxation
- strictly convex
- constraint programming
- cutting plane algorithm
- set covering problem
- convex optimization
- facility location
- cutting plane
- integer program
- special case
- set covering
- inference problems
- convex hull
- network flow
- objective function
- set partitioning
- convex programming
- linear programming relaxation
- valid inequalities
- convex relaxation
- genetic algorithm