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):
Displayed 6 items.
- A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery (Q713116) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems (Q1681305) (← links)
- A multi-cover routing problem for planning rapid needs assessment under different information-sharing settings (Q2178909) (← links)
- The orienteering problem with variable profits (Q5326782) (← links)