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 9 items.
- A greedy algorithm for finding maximum spanning trees in infinite graphs (Q2102829) (← links)
- Serving rides of equal importance for time-limited dial-a-ride (Q2117614) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems (Q2164695) (← links)
- Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
- 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)
