Pages that link to "Item:Q1651623"
From MaRDI portal
The following pages link to Generalized multiple depot traveling salesmen problem -- polyhedral study and exact algorithm (Q1651623):
Displaying 16 items.
- A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem (Q315496) (← links)
- Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
- Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
- Multiple depot ring star problem: a polyhedral study and an exact algorithm (Q513163) (← links)
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations (Q814246) (← links)
- A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem (Q1681265) (← links)
- Dealing with time in the multiple traveling salespersons problem with moving targets (Q2155136) (← links)
- Multi-depot traveling salesmen location problems on networks with special structure (Q2178369) (← links)
- A branch-and-cut algorithm for the generalized traveling salesman problem with time windows (Q2189879) (← links)
- Upper and lower bounds for the sales force deployment problem with explicit contiguity constraints (Q2253998) (← links)
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem (Q2467447) (← links)
- Integer linear programming formulations of multiple salesman problems and its variations (Q2503218) (← links)
- A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem (Q3569885) (← links)
- Memetic algorithm-based path generation for multiple Dubins vehicles performing remote tasks (Q5026663) (← links)
- Selective generalized travelling salesman problem (Q5069320) (← links)
- A comprehensive survey on the generalized traveling salesman problem (Q6556079) (← links)