Pages that link to "Item:Q5119847"
From MaRDI portal
The following pages link to Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems (Q5119847):
Displaying 4 items.
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems (Q5085153) (← links)
- Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
- A unified approach to approximate partial, prize-collecting, and budgeted sweep cover problems (Q6151530) (← links)
