Stronger Lower Bounds for the Quadratic Minimum Spanning Tree Problem with Adjacency Costs.
Dilson Lucas PereiraMichel GendreauAlexandre Salles da CunhaPublished in: Electron. Notes Discret. Math. (2013)
Keyphrases
- lower bound
- objective function
- upper bound
- branch and bound algorithm
- computational complexity
- lower and upper bounds
- branch and bound
- expected cost
- np hard
- upper and lower bounds
- total cost
- pairwise
- optimal solution
- lower bounding
- optimal cost
- active learning
- worst case
- cost savings
- polynomial approximation
- neural network
- search space
- vc dimension
- concept class