Pages that link to "Item:Q2427697"
From MaRDI portal
The following pages link to Approximation of the quadratic set covering problem (Q2427697):
Displaying 7 items.
- On a linearization technique for solving the quadratic set covering problem and variations (Q1676486) (← links)
- Relation between set partitioning and set covering problems with quadratic fractional objective functions (Q1929500) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- Approximation of the clustered set covering problem (Q2883599) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
- Approximation algorithms for cost-robust discrete minimization problems based on their LP-relaxations (Q5970783) (← links)
- Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems (Q6114924) (← links)