Pages that link to "Item:Q4096709"
From MaRDI portal
The following pages link to A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem (Q4096709):
Displaying 12 items.
- Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives (Q260641) (← links)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- Cluster generation and grouping using mathematical programming (Q1255741) (← links)
- 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)
- Combinatorial optimization with interaction costs: complexity and solvable cases (Q2010918) (← links)
- Orientational variable-length strip covering problem: a branch-and-price-based algorithm (Q2028818) (← links)
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows (Q2434985) (← links)
- AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING (Q4178781) (← links)
- A Linearization technique for solving the quadratic set covering problem (Q4331991) (← links)
- A Branch-and-Bound Algorithm for Team Formation on Social Networks (Q5085484) (← links)
