Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices.
Sylvia C. BoydRobert CarrPublished in: Discret. Optim. (2011)
Keyphrases
- low cost
- optimal solution
- traveling salesman problem
- subtour elimination
- image matching
- aco algorithms
- maximum matching
- matching algorithm
- genetic algorithm
- ant colony optimization
- travelling salesman
- combinatorial optimization
- benchmark problems
- graph matching
- low power
- feasible solution
- real time
- pattern matching
- optimization problems
- search space
- solution quality
- bipartite graph
- undirected graph
- graph cuts
- maximum cardinality
- neural network