Pages that link to "Item:Q1226033"
From MaRDI portal
The following pages link to Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient (Q1226033):
Displayed 9 items.
- The optimum assignments and a new heuristic approach for the traveling salesman problem (Q1051562) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Genetic algorithms and traveling salesman problems (Q1268132) (← links)
- Data-independent neighborhood functions and strict local optima (Q1763477) (← links)
- Polynomial transformations and data-independent neighborhood functions (Q1887061) (← links)
- An analysis of neighborhood functions on generic solution spaces (Q2462147) (← links)
- On the Relative Complexity of 15 Problems Related to 0/1-Integer Programming (Q2971619) (← links)
- The traveling salesman problem: An update of research (Q3671783) (← links)
- The adjacency relation on the traveling salesman polytope is NP-Complete (Q4153924) (← links)