Pages that link to "Item:Q1338450"
From MaRDI portal
The following pages link to The traveling salesman. Computational solutions for RSP applications (Q1338450):
Displaying 50 items.
- On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem (Q296693) (← links)
- Robust optimization for routing problems on trees (Q301384) (← links)
- A distribution-free TSP tour length estimation model for random graphs (Q319156) (← links)
- hCHAC: a family of MOACO algorithms for the resolution of the bi-criteria military unit pathfinding problem (Q336313) (← links)
- Solving the dynamic traveling salesman problem using a genetic algorithm with trajectory prediction: an application to fish aggregating devices (Q337442) (← links)
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453) (← links)
- Symmetric weight constrained traveling salesman problem: Local search (Q535615) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem (Q691417) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- Path optimization with limited sensing ability (Q729301) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- The multiple traveling salesmen problem with moving targets (Q895767) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem (Q1044139) (← links)
- Heuristics for the rural postman problem (Q1046717) (← links)
- Linear programs for constraint satisfaction problems (Q1278588) (← links)
- Estimating the Held-Karp lower bound for the geometric TSP (Q1291588) (← links)
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP (Q1348379) (← links)
- TSP ejection chains (Q1363749) (← links)
- A column generation approach to capacitated \(p\)-median problems (Q1433151) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- A new variant of a vehicle routing problem: Lower and upper bounds (Q1598727) (← links)
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems (Q1600930) (← links)
- Relaxed tours and path ejections for the traveling salesman problem (Q1609913) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- Intelligent-guided adaptive search for the maximum covering location problem (Q1652063) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem (Q1659213) (← links)
- The traveling salesman problem on grids with forbidden neighborhoods (Q1680496) (← links)
- Improving the Hopfield model performance when applied to the traveling salesman problem. A divide-and-conquer scheme (Q1701902) (← links)
- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions (Q1751254) (← links)
- The approximation ratio of the greedy algorithm for the metric traveling salesman problem (Q1785355) (← links)
- Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- Implementation of ensemble-based simulated annealing with dynamic load balancing under MPI (Q1967216) (← links)
- Fast, efficient and accurate solutions to the Hamiltonian path problem using neural approaches (Q1974282) (← links)
- Record breaking optimization results using the ruin and recreate principle (Q1976826) (← links)
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane (Q2003422) (← links)
- Angular bisector insertion algorithm for solving small-scale symmetric and asymmetric traveling salesman problem (Q2075470) (← links)
- Equivalent cyclic polygon of a euclidean travelling salesman problem tour and modified formulation (Q2103946) (← links)
- Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
