Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem.
Dilson Lucas PereiraMichel GendreauAlexandre Salles da CunhaPublished in: Networks (2015)
Keyphrases
- times faster
- learning algorithm
- benchmark datasets
- theoretical analysis
- objective function
- orders of magnitude
- worst case
- recently developed
- real world
- computational efficiency
- classification algorithm
- machine learning algorithms
- optimization problems
- computational complexity
- similarity measure
- case study
- website
- social networks