On a linearization technique for solving the quadratic set covering problem and variations (Q1676486): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-016-1081-x / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2962876538 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1509.06305 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / 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: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of linearizable instances of the quadratic minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the quadratic set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with approximation algorithms for the set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem / 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: Compact linearization for binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linearization technique for solving the quadratic set covering problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-016-1081-X / rank
 
Normal rank

Latest revision as of 05:36, 28 December 2024

scientific article
Language Label Description Also known as
English
On a linearization technique for solving the quadratic set covering problem and variations
scientific article

    Statements

    On a linearization technique for solving the quadratic set covering problem and variations (English)
    0 references
    0 references
    0 references
    9 November 2017
    0 references
    0-1 programming
    0 references
    quadratic programming
    0 references
    agorithms
    0 references
    set covering problem
    0 references
    heuristic
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references