Pages that link to "Item:Q4024311"
From MaRDI portal
The following pages link to Fast Algorithms for Geometric Traveling Salesman Problems (Q4024311):
Displaying 50 items.
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
- Traveling salesman problem heuristics: leading methods, implementations and latest advances (Q418054) (← links)
- Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand (Q439376) (← links)
- Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
- A discrete gravitational search algorithm for solving combinatorial optimization problems (Q498096) (← links)
- A hybrid particle swarm optimization approach for the sequential ordering problem (Q622165) (← links)
- Assigning real-time tasks to heterogeneous processors by applying ant colony optimization (Q635307) (← links)
- Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- A class of exponential neighbourhoods for the quadratic travelling salesman problem (Q782742) (← links)
- Multiple phase neighborhood search---GRASP based on Lagrangean relaxation, random backtracking Lin-Kernighan and path relinking for the TSP (Q841596) (← links)
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts (Q863988) (← links)
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands (Q975999) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) (← links)
- Speed-up techniques for solving large-scale biobjective TSP (Q1038291) (← links)
- Transgenetic algorithm for the traveling purchaser problem (Q1042095) (← links)
- Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104) (← links)
- On the solving strategy in composite heuristics (Q1200786) (← links)
- New edges not used in shortest tours of TSP (Q1291639) (← links)
- Genetically improved presequences for Euclidean traveling salesman problems (Q1341408) (← links)
- A new adaptive multi-start technique for combinatorial global optimizations (Q1342281) (← links)
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem (Q1362516) (← links)
- Variable neighborhood search (Q1374041) (← links)
- Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep (Q1384210) (← links)
- An effective implementation of the Lin-Kernighan traveling salesman heuristic (Q1584821) (← links)
- Method to solve the travelling salesman problem using the inverse of diffusion process (Q1596595) (← links)
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
- An improved ant colony system for the sequential ordering problem (Q1652370) (← links)
- Introducing complexity curtailing techniques for the tour construction heuristics for the travelling salesperson problem (Q1659213) (← links)
- Solving large-scale TSP using a fast wedging insertion partitioning approach (Q1666767) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- Guided local search and its application to the traveling salesman problem (Q1808420) (← links)
- A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← links)
- Embedded local search approaches for routing optimization (Q1886851) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- Genetic algorithms for the traveling salesman problem (Q1919848) (← links)
- Coupling ant colony systems with strong local searches (Q1926808) (← links)
- Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
- IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem (Q2337843) (← links)
- Estimation-based metaheuristics for the single vehicle routing problem with stochastic demands and customers (Q2350870) (← links)
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering (Q2383954) (← links)
- The traveling group problem (Q2385125) (← links)
- Sequential search and its application to vehicle-routing problems (Q2489298) (← links)
