Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
From MaRDI portal
Cited in
(33)- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Transformations of generalized ATSP into ATSP.
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
- Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout
- Variable neighborhood search for the set orienteering problem and its application to other orienteering problem variants
- The set orienteering problem
- Generalized network design problems.
- The vehicle routing-allocation problem: A unifying framework
- Routing problems: A bibliography
- An extremal constrained routing problem with internal losses
- Optimization of Cartesian tasks with configuration selection
- Algorithms for the design of network topologies with balanced disjoint rings
- New mathematical models of the generalized vehicle routing problem and extensions
- A taxonomical analysis, current methods and objectives on location-routing problems
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Discrete/Binary approach
- On an iterative procedure for solving a routing problem with constraints
- A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
- Formulations for the clustered traveling salesman problem with d-relaxed priority rule
- An adaptive memory matheuristic for the set orienteering problem
- The cumulative school bus routing problem: Polynomial‐size formulations
- A comprehensive survey on the generalized traveling salesman problem
- A survey on the traveling salesman problem and its variants in a warehousing context
- A unifying framework for selective routing problems
- Beer path problems in temporal graphs
- An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
- A random-key genetic algorithm for the generalized traveling salesman problem
- Solving a generalized traveling salesperson problem with stochastic customers
- A classification scheme for vehicle routing and scheduling problems
- A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem
- A branch-and-price algorithm for placement routing for a multi-head beam-type component placement tool
This page was built for publication: Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3037137)
