Pages that link to "Item:Q2288980"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980):
Displaying 3 items.
- Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
