Pages that link to "Item:Q3057103"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103):
Displaying 20 items.
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- A note on the prize collecting traveling salesman problem (Q687042) (← links)
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem (Q1265891) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- A branch-and-cut algorithm for the target visitation problem (Q2294072) (← links)
- Solving the traveling circus problem by branch \& cut (Q2741339) (← links)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400) (← links)
- The prize collecting traveling salesman problem (Q3832349) (← links)
- A branch-and-cut algorithm for the undirected selective traveling salesman problem (Q4540081) (← links)
- The prize collecting traveling salesman problem: II. Polyhedral results (Q4861350) (← links)
- Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)
- FIXED RATIO POLYNOMIAL TIME APPROXIMATION ALGORITHM FOR THE PRIZE-COLLECTING ASYMMETRIC TRAVELING SALESMAN PROBLEM (Q6081704) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
