Pages that link to "Item:Q3936521"

The following pages link to On the worst-case performance of some algorithms for the asymmetric traveling salesman problem (Q3936521):

Displaying 50 items.

• Traveling salesman problems in temporal graphs (Q284573) (← links)
• Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
• The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
• Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
• A simple LP relaxation for the asymmetric traveling salesman problem (Q378136) (← links)
• Quell (Q500997) (← links)
• The directed orienteering problem (Q547309) (← links)
• Minimum-weight two-connected spanning networks (Q582215) (← links)
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
• Towards auction algorithms for large dense assignment problems (Q839685) (← links)
• LP-based solution methods for the asymmetric TSP (Q845937) (← links)
• An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
• On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
• Approximately fair cost allocation in metric traveling salesman games (Q927408) (← links)
• The on-line asymmetric traveling salesman problem (Q935844) (← links)
• On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
• Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem (Q1119486) (← links)
• A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem (Q1130068) (← links)
• Analysis of the Held-Karp lower bound for the asymmetric TSP (Q1200770) (← links)
• An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
• A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
• A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
• A note on the approximation of the asymmetric traveling salesman problem. (Q1417511) (← links)
• Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
• Approximating the minimum tour cover of a digraph (Q1736480) (← links)
• Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
• Complexity of the directed spanning cactus problem (Q1765377) (← links)
• Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems (Q2392924) (← links)
• An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
• Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
• Traveling salesman path problems (Q2476987) (← links)
• Asymmetry in \(k\)-center variants (Q2503348) (← links)
• A study of complexity transitions on the asymmetric traveling salesman problem (Q2674187) (← links)
• Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems (Q2674191) (← links)
• No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem (Q2800373) (← links)
• Approximating the asymmetric profitable tour (Q2861509) (← links)
• A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
• Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
• An Improved Integrality Gap for Asymmetric TSP Paths (Q3186524) (← links)
• The Directed Minimum Latency Problem (Q3541796) (← links)
• A Simple LP Relaxation for the Asymmetric Traveling Salesman Problem (Q3541797) (← links)
• Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem (Q3730367) (← links)
• Improved length bounds for the shortest superstring problem (Q5057460) (← links)
• APPROXIMATING ASYMMETRIC TSP IN EXPONENTIAL TIME (Q5168426) (← links)
• Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems (Q5240198) (← links)
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
• The temporal explorer who returns to the base (Q5918316) (← links)