Pages that link to "Item:Q2861509"
From MaRDI portal
The following pages link to Approximating the asymmetric profitable tour (Q2861509):
Displaying 9 items.
- Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests (Q322826) (← links)
- Exact methods for solving the elementary shortest and longest path problems (Q512936) (← links)
- Approximating the minimum tour cover of a digraph (Q1736480) (← links)
- Approximating the asymmetric profitable tour (Q1758879) (← links)
- A primal-dual approximation algorithm for the asymmetric prize-collecting TSP (Q1944387) (← links)
- The multi-vehicle profitable pickup and delivery problem (Q2362250) (← links)
- Solving the probabilistic profitable tour problem on a line (Q6081600) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Improved approximation algorithm for the asymmetric prize-collecting TSP (Q6167003) (← links)