Constructing extremal triangle-free graphs using integer programming.
Ali Erdem BanakTínaz EkimZ. Caner TaskinPublished in: CoRR (2023)
Keyphrases
- integer programming
- graph theory
- linear programming
- np hard
- lagrangian relaxation
- production planning
- constraint programming
- column generation
- network flow
- set covering
- integer program
- ai planning
- cutting plane
- facility location
- set covering problem
- valid inequalities
- transportation problem
- dantzig wolfe decomposition
- bipartite graph
- cutting plane algorithm
- set partitioning
- inference problems
- particle swarm optimization
- np complete
- round robin tournament
- crew scheduling
- feasible solution