Pages that link to "Item:Q1003471"
From MaRDI portal
The following pages link to Approximation algorithms for group prize-collecting and location-routing problems (Q1003471):
Displaying 5 items.
- A survey of recent research on location-routing problems (Q296678) (← links)
- An approximation algorithm for the group prize-collecting Steiner tree problem with submodular penalties (Q2167423) (← links)
- A survey of variants and extensions of the location-routing problem (Q2629668) (← links)
- (Q5417636) (← links)
- A branch-and-cut algorithm for the windy profitable location rural postman problem (Q6644370) (← links)