Pages that link to "Item:Q1170119"

The following pages link to The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119):

Displaying 26 items.

• Symmetric traveling salesman problems (Q721684) (← links)
• The symmetric clustered traveling salesman problem (Q759661) (← links)
• On dual solutions of the linear assignment problem (Q761971) (← links)
• Transforming asymmetric into symmetric traveling salesman problems (Q787877) (← links)
• Minimum deviation and balanced optimization: A unified approach (Q806674) (← links)
• Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations (Q908860) (← links)
• A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
• Improved polynomial algorithms for robust bottleneck problems with interval data (Q1046706) (← links)
• A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
• Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
• A Lagrangean approach to the degree-constrained minimum spanning tree problem (Q1121788) (← links)
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
• Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
• An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
• Solving some lexicographic multi-objective combinatorial problems (Q1598728) (← links)
• Fictitious upper bounds in an algorithm for the symmetric traveling salesman problem (Q1824571) (← links)
• New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
• The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems (Q2399487) (← links)
• A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
• Some inverse optimization problems under the Hamming distance (Q2575571) (← links)
• A gene-pool based genetic algorithm for TSP (Q4454481) (← links)
• Improved algorithms for the Steiner problem in networks (Q5946826) (← links)
• Mapping tree-structured combinatorial optimization problems onto parallel computers (Q6560206) (← links)