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 11 items.
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants (Q716345) (← links)
- Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
- Covering a graph with cycles. (Q1406651) (← links)
- Minimum constellation covers: hardness, approximability and polynomial cases (Q2025056) (← links)
- Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
- A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
- An optimal strategy for the constrained cycle cover problem (Q2741265) (← links)
- A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
- An exact algorithm for the maximal covering problem (Q4883162) (← links)
- Branch-and-cut algorithms for the covering salesman problem (Q6050582) (← links)
