A Linearization technique for solving the quadratic set covering problem
From MaRDI portal
Recommendations
- Linearization approach to multi-objective quadratic set covering problem
- Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
- Relation between set partitioning and set covering problems with quadratic fractional objective functions
- Relation between set covering and set partitioning problems
- A linearization technique for quadratic integer programming with box constraint
Cites work
- A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
- Computer Solutions to Minimum-Cover Problems
- Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
Cited in
(8)- Relation between set covering and set partitioning problems
- On a linearization technique for solving the quadratic set covering problem and variations
- Relation between set partitioning and set covering problems with quadratic fractional objective functions
- Solving fuzzy linear fractional set covering problem by a goal programming based solution approach
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
- Linearization approach to multi-objective quadratic set covering problem
- A Branch-and-Bound Algorithm for Team Formation on Social Networks
This page was built for publication: A Linearization technique for solving the quadratic set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4331991)
