Pages that link to "Item:Q3980516"
From MaRDI portal
The following pages link to A Lagrangian Based Approach for the Asymmetric Generalized Traveling Salesman Problem (Q3980516):
Displayed 29 items.
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem (Q621685) (← links)
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem (Q846437) (← links)
- A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
- ACS-TS: Train scheduling using ant colony system (Q955488) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool (Q991821) (← links)
- Approximation algorithms for group prize-collecting and location-routing problems (Q1003471) (← links)
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs (Q1280545) (← links)
- A model for warehouse order picking (Q1291697) (← links)
- An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391) (← links)
- Routing heuristics for automated pick and place machines (Q1806942) (← links)
- Generalized network design problems. (Q1810478) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
- Branch-and-bound for the precedence constrained generalized traveling salesman problem (Q1984690) (← links)
- Local-ideal-points based autonomous space decomposition framework for the multi-objective periodic generalized directed rural postman problem under length restrictions with intermediate facilities (Q2108153) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Motion planning algorithms for the Dubins Travelling Salesperson Problem (Q2409439) (← links)
- New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
- A review of TSP based approaches for flowshop scheduling (Q2572854) (← links)
- Household-Level Economies of Scale in Transportation (Q2957463) (← links)
- Discrete/Binary Approach (Q3649626) (← links)
- Vehicle routing with stochastic demands and restricted failures (Q4201811) (← links)
- The Multiple Traveling Salesmen Problem with Moving Targets and Nonlinear Trajectories (Q4685796) (← links)
- Cluster-level operations planning for the out-of-position robotic arc-welding (Q5478828) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)