Pages that link to "Item:Q3652189"
From MaRDI portal
The following pages link to Exact Algorithms for Set Multicover and Multiset Multicover Problems (Q3652189):
Displaying 9 items.
- A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- On resilient feature selection: computational foundations of \(r\)-\(\mathbb{C} \)-reducts (Q2215062) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- The robust minimal controllability problem (Q2409157) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)
- The \textsc{Exact Subset MultiCover} problem (Q6652461) (← links)
