Constructing extremal triangle-free graphs using integer programming.
Ali Erdem BanakTínaz EkimZ. Caner TaskinPublished in: Discret. Optim. (2023)
Keyphrases
- integer programming
- graph theory
- np hard
- lagrangian relaxation
- linear programming
- production planning
- constraint programming
- crew scheduling
- set covering problem
- ai planning
- valid inequalities
- cutting plane
- integer program
- column generation
- linear programming relaxation
- facility location
- inference problems
- undirected graph
- transportation problem
- vehicle routing problem with time windows
- cutting plane algorithm
- evolutionary algorithm
- set covering
- branch and bound algorithm
- dantzig wolfe decomposition