Pages that link to "Item:Q1652391"

The following pages link to GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem (Q1652391):

Displaying 14 items.

• GTSP-LIB (Q37303) (← 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)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← 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)