Pages that link to "Item:Q2247803"
From MaRDI portal
The following pages link to Reoptimization of set covering problems (Q2247803):
Displaying 7 items.
- Reoptimization of constraint satisfaction problems with approximation resistant predicates (Q380664) (← links)
- Reoptimization of max \(k\)-cover: approximation ratio threshold (Q466363) (← links)
- On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field (Q466374) (← links)
- Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization (Q2168048) (← links)
- Parameterized Dynamic Variants of Red-Blue Dominating Set (Q3297772) (← links)
- (Q4269169) (← links)
- Reoptimization of NP-Hard Problems (Q6163646) (← links)