Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
From MaRDI portal
Recommendations
- Linearization approach to multi-objective quadratic set covering problem
- Publication:4860677
- A goal programming approach to solve linear fractional multi-objective set covering problem.
- Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
- Enumeration technique for set covering problems: a combinatorial approach
Cites work
- A Greedy Heuristic for the Set-Covering Problem
- Computer Solutions to Minimum-Cover Problems
- Cutting planes from conditional bounds: A new approach to set covering
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3175708 (Why is no real title available?)
- scientific article; zbMATH DE number 834594 (Why is no real title available?)
- Linear approach to linear fractional goal programming
- Set Covering and Involutory Bases
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
Cited in
(5)- A goal programming approach to solve linear fractional multi-objective set covering problem.
- A Linearization technique for solving the quadratic set covering problem
- Linearization approach to multi-objective quadratic set covering problem
- scientific article; zbMATH DE number 834594 (Why is no real title available?)
- Enumeration technique for set covering problems: a combinatorial approach
This page was built for publication: Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1929504)