Pages that link to "Item:Q4140001"
From MaRDI portal
The following pages link to An Analysis of Several Heuristics for the Traveling Salesman Problem (Q4140001):
Displayed 50 items.
- Flexible pair-copula estimation in D-vines using bivariate penalized splines (Q261005) (← links)
- Ordered spatial sampling by means of the traveling salesman problem (Q333365) (← links)
- Online network design with outliers (Q334928) (← links)
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- On the greedy walk problem (Q383202) (← links)
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees (Q489718) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- On the nearest neighbor rule for the metric traveling salesman problem (Q496440) (← links)
- Minimum-weight two-connected spanning networks (Q582215) (← links)
- An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem (Q583125) (← links)
- Concurrent counting is harder than queuing (Q604464) (← links)
- An analysis of the extended Christofides heuristic for the \(k\)-depot TSP (Q635520) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- On-line Steiner trees in the Euclidean plane (Q685176) (← links)
- A competitive analysis of algorithms for searching unknown scenes (Q685600) (← links)
- Worst-case analysis of two travelling salesman heuristics (Q786657) (← links)
- An improved lower bound for competitive graph exploration (Q831137) (← links)
- A new intuitional algorithm for solving heterogeneous fixed fleet routing problems: passenger pickup algorithm (Q856161) (← links)
- General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
- A hybrid scatter search for the probabilistic traveling salesman problem (Q878568) (← links)
- Compatible connectivity augmentation of planar disconnected graphs (Q894688) (← links)
- The selective travelling salesman problem (Q910347) (← links)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
- Greedy heuristics with regret, with application to the cheapest insertion algorithm for the TSP (Q935238) (← links)
- Weighted nearest neighbor algorithms for the graph exploration problem on cycles (Q990116) (← links)
- The pickup and delivery traveling salesman problem with first-in-first-out loading (Q1000960) (← links)
- The traveling purchaser problem with budget constraint (Q1013406) (← links)
- Approximation algorithms for multi-criteria traveling salesman problems (Q1017906) (← links)
- A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
- Transgenetic algorithm for the traveling purchaser problem (Q1042095) (← links)
- Reoptimization of minimum and maximum traveling salesman's tours (Q1044031) (← links)
- On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem (Q1078097) (← links)
- A geometric problem involving the nearest neighbour algorithm (Q1094335) (← links)
- ALTO: A computer system for the design of vehicle routing algorithms (Q1119169) (← links)
- Cost of sequential connection for points in space (Q1122502) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- Dynamic programming based heuristics for the topological design of local access networks (Q1179743) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A multiperiod traveling salesman problem: Heuristic algorithms (Q1195106) (← links)
- Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
- An approximation algorithm for the asymmetric travelling salesman problem with distances one and two (Q1209363) (← links)
- On the solutions of stochastic traveling salesman problems (Q1247370) (← links)
- Practical aspects of route planning for magazine and newspaper wholesalers (Q1266509) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- An empirical study of a new metaheuristic for the traveling salesman problem (Q1291637) (← links)
- A model for warehouse order picking (Q1291697) (← links)
- Combined location-routing problems: A synthesis and future research directions (Q1295989) (← links)