Pages that link to "Item:Q1158108"

The following pages link to A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation (Q1158108):

Displaying 34 items.

• TSP race: minimizing completion time in time-sensitive applications (Q319282) (← links)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• Symmetric traveling salesman problems (Q721684) (← links)
• The symmetric clustered traveling salesman problem (Q759661) (← links)
• A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
• Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
• A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
• Edge exchanges in the degree-constrained minimum spanning tree problem (Q1086497) (← links)
• A simulation tool for the performance evaluation of parallel branch and bound algorithms (Q1111941) (← links)
• Identification of non-optimal arcs for the traveling salesman problem (Q1165781) (← links)
• The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
• Travelling salesman problem tools for microcomputers (Q1184464) (← links)
• The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
• Optimizing tabu list size for the traveling salesman problem (Q1265842) (← links)
• Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
• Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
• An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
• Lower bounding techniques for frequency assignment (Q1292811) (← links)
• Improving heuristics for the frequency assignment problem (Q1296060) (← links)
• A branch and bound algorithm for symmetric 2-peripatetic salesman problems (Q1310005) (← links)
• A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex (Q1577763) (← links)
• An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
• Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
• A discrete cross aisle design model for order-picking warehouses (Q1713732) (← links)
• New lower bounds for the symmetric travelling salesman problem (Q1824572) (← links)
• The symmetric travelling salesman problem. II: New low bounds (Q1956919) (← links)
• Efficient optimization of the Held-Karp lower bound (Q2165584) (← links)
• An efficient heuristic algorithm for the bottleneck traveling salesman problem (Q2269075) (← links)
• Sensitivity analysis for symmetric 2-peripatetic salesman problems (Q2367396) (← links)
• A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)
• A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
• Bounds for the symmetric 2-peripatetic salesman problem (Q4327897) (← links)
• Coarse-Graining Large Search Landscapes Using Massive Edge Collapse (Q5147729) (← links)
• Iterative state-space reduction for flexible computation (Q5940821) (← links)