Combinatorial optimization with one quadratic term: Spanning trees and forests.
Christoph BuchheimLaura KleinPublished in: Discret. Appl. Math. (2014)
Keyphrases
- combinatorial optimization
- spanning tree
- edge disjoint
- traveling salesman problem
- minimum spanning tree
- simulated annealing
- combinatorial optimization problems
- metaheuristic
- minimum spanning trees
- optimization problems
- minimum cost
- branch and bound
- branch and bound algorithm
- combinatorial problems
- objective function
- mathematical programming
- computational complexity
- regularization term
- quadratic assignment problem
- vehicle routing problem
- graph theory
- pairwise
- tabu search
- undirected graph
- special case
- edge weights
- single machine scheduling problem
- combinatorial search
- genetic algorithm
- random walk
- cost function