Graph theoretic relaxations of set covering and set partitioning problems (Q1390264): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network relaxation based enumeration algorithm for set partitioning / 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: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3688098 / 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: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of set partitioning with application to scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covers and packings in a family of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dioïds and semirings: Links to fuzzy sets and other applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach for crew pairing problems by column generation with an application to air transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean Relaxation Algorithm for the Two Duty Period Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal set partitioning, matchings and lagrangian duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some characterisations of totally unimodular matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3996913 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)00115-s / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001536197 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:47, 30 July 2024

scientific article
Language Label Description Also known as
English
Graph theoretic relaxations of set covering and set partitioning problems
scientific article

    Statements

    Graph theoretic relaxations of set covering and set partitioning problems (English)
    0 references
    0 references
    0 references
    14 July 1998
    0 references
    graph theoretic relaxations
    0 references
    set covering
    0 references
    set partitioning
    0 references
    network relaxation
    0 references
    greedy method
    0 references
    assignment
    0 references
    shortest route
    0 references
    minimum spanning tree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers