An algorithm for set covering problem (Q1823139): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: John E. Beasley / rank
Normal rank
 
Property / author
 
Property / author: John E. Beasley / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes from conditional bounds: A new approach to set covering / 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: Q3048579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Trivial and Binding Constraints in Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Computational Survey of Methods for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Set-Covering Problem: A New Implicit Enumeration Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Integer Programming Approach to the Vehicle Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Set Partitioning Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for large scale set covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Private and Public Sector Location Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying Redundant Constraints and Implicit Equalities in Systems of Linear Constraints / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(87)90141-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1977723771 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
An algorithm for set covering problem
scientific article

    Statements

    An algorithm for set covering problem (English)
    0 references
    1987
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    set covering
    0 references
    problem reduction tests
    0 references
    dual ascent
    0 references
    subgradient optimization
    0 references
    0 references
    0 references