Pages that link to "Item:Q4367232"
From MaRDI portal
The following pages link to A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem (Q4367232):
Displaying 12 items.
- 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)
- The cumulative school bus routing problem: Polynomial‐size formulations (Q6180039) (← links)
- A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group (Q6180040) (← links)
- Problem-Specific Branch-and-Bound Algorithms for the Precedence Constrained Generalized Traveling Salesman Problem (Q6488350) (← links)
- New path elimination constraints for multi-depot routing problems (Q6496355) (← links)
- Modeling and solving the two-level generalized median tour problem (Q6551171) (← links)
- An effective hybrid evolutionary algorithm for the clustered orienteering problem (Q6555127) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)
- The multicolored graph realization problem (Q6558680) (← links)
- Shore hydrogen deployment problem in green ports (Q6561230) (← links)