Pages that link to "Item:Q1652391"
From MaRDI portal
The following pages link to GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391):
Displaying 26 items.
- GTSP-LIB (Q37303) (← links)
- Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem (Q439653) (← links)
- Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm (Q499157) (← links)
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem (Q2123564) (← links)
- Recent advances in selection hyper-heuristics (Q2183846) (← links)
- A transformation technique for the clustered generalized traveling salesman problem with applications to logistics (Q2183848) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- A survey of adaptive large neighborhood search algorithms and applications (Q2676311) (← links)
- PCGLNS: a heuristic solver for the precedence constrained generalized traveling salesman problem (Q2679785) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints (Q5040957) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
- Heuristic approaches for the family traveling salesman problem (Q6070420) (← links)
- Precedence constrained generalized traveling salesman problem: polyhedral study, formulations, and branch-and-cut algorithm (Q6112583) (← links)
- An adaptive memory matheuristic for the set orienteering problem (Q6112827) (← links)
- New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem (Q6114932) (← links)
- The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm (Q6179711) (← links)
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem (Q6488350) (← links)
- Modeling and solving the two-level generalized median tour problem (Q6551171) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
- Fault-tolerant families of production plans: mathematical model, computational complexity, and branch-and-bound algorithms (Q6588151) (← links)
- Reliable production process design problem: compact MILP model and ALNS-based primal heuristic (Q6588744) (← links)
