A Linearization technique for solving the quadratic set covering problem (Q4331991): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1080/02331939708844269 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2034831675 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3214706 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computer Solutions to Minimum-Cover Problems / rank | |||
Normal rank |
Latest revision as of 09:42, 27 May 2024
scientific article; zbMATH DE number 977844
Language | Label | Description | Also known as |
---|---|---|---|
English | A Linearization technique for solving the quadratic set covering problem |
scientific article; zbMATH DE number 977844 |
Statements
A Linearization technique for solving the quadratic set covering problem (English)
0 references
4 August 1997
0 references
linearization technique
0 references
optimal cover solution
0 references
quadratic set covering
0 references
0 references