Lower bounds and exact algorithms for the quadratic minimum spanning tree problem.
Dilson Lucas PereiraMichel GendreauAlexandre Salles da CunhaPublished in: Comput. Oper. Res. (2015)
Keyphrases
- exact algorithms
- lower bound
- max sat
- exact solution
- objective function
- upper bound
- knapsack problem
- approximation algorithms
- branch and bound
- benchmark instances
- branch and bound algorithm
- optimal solution
- vehicle routing problem with time windows
- np hard
- worst case
- combinatorial optimization problems
- computational problems
- heuristic methods
- exact methods
- benders decomposition
- combinatorial optimization
- nonlinear programming
- lower and upper bounds
- vc dimension
- combinatorial problems
- computational complexity
- optimization problems
- sat solvers
- search algorithm
- cost function
- satisfiability problem
- sat problem
- information retrieval
- tabu search
- running times
- metaheuristic
- linear program
- information retrieval systems