Finding Totally Independent Spanning Trees with Linear Integer Programming.
Alexandre Salles da CunhaFernanda Sumika Hojo de SouzaPublished in: ISCO (2014)
Keyphrases
- integer programming
- spanning tree
- edge disjoint
- np hard
- minimum cost
- linear programming
- total length
- lagrangian relaxation
- minimum spanning tree
- set covering problem
- constraint programming
- minimum spanning trees
- production planning
- network flow
- valid inequalities
- ai planning
- minimum total cost
- cutting plane
- column generation
- facility location
- inference problems
- cutting plane algorithm
- integer program
- transportation problem
- dantzig wolfe decomposition
- set covering
- optimal solution
- weighted graph
- approximation algorithms
- integer programming formulations