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 47 items.
- 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)
- 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)
- The competitiveness of randomized algorithms for on-line Steiner tree and on-line spanning tree problems (Q1313740) (← links)
- Not all insertion methods yield constant approximate tours in the Euclidean plane (Q1318697) (← links)
- Edge crossings in drawings of bipartite graphs (Q1322570) (← links)
- Constructing competitive tours from local information (Q1331954) (← links)
- The travelling salesman problem with pick-up and delivery (Q1342068) (← links)
- The traveling salesman problem with delivery and backhauls (Q1342089) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Compact location problems (Q1391322) (← links)
- Using global search heuristics for the capacity vehicle routing problem. (Q1406639) (← links)
- On the nearest neighbor rule for the traveling salesman problem (Q1433650) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- A tabu search heuristic for the undirected selective travelling salesman problem (Q1609914) (← links)
- Insertion techniques for the heuristic solution of the job shop problem (Q1805458) (← links)
- A new hybrid heuristic approach for solving large traveling salesman problem (Q1886765) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
- Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem (Q2367039) (← links)
- Further results on the probabilistic traveling salesman problem (Q2368298) (← links)
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity (Q2569152) (← links)
- A Neural-Network-Based Approach to the Double Traveling Salesman Problem (Q2780866) (← links)
- SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161) (← links)
- Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach (Q3217446) (← links)
- On the refinement of bounds of heuristic algorithms for the traveling salesman problem (Q3678965) (← links)
- Compact storage schemes for formatted files by spanning trees (Q3851615) (← links)
- A note on heuristics for the traveling salesman problem (Q3879044) (← links)
- (Q3907583) (← links)
- Bewertung heuristischer Methoden (Q3941214) (← links)
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469) (← links)
- Lower Bounds for Insertion Methods for TSP (Q4314147) (← links)
- AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS (Q4675892) (← links)