Pages that link to "Item:Q4347274"
From MaRDI portal
The following pages link to Restricted delivery problems on a network (Q4347274):
Displaying 17 items.
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- Restricted connectivity for some interconnection networks (Q497373) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Approximation algorithms for general cluster routing problem (Q2019492) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- Generalized model of courier with additional restrictions (Q2806800) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- The preemptive swapping problem on a tree (Q3100688) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6039533) (← links)
- Achieving feasibility for clustered traveling salesman problems using PQ‐trees (Q6139372) (← links)
- An approximation algorithm for the clustered path travelling salesman problem (Q6167001) (← links)
