Automatic identification of embedded network rows in large-scale optimization models (Q3315283): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of mathematical programming problems prior to applying the simplex algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized upper bounding techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization approach to large-scale linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining GUB sets via an invert agenda algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization: What is the State of the Art / rank
 
Normal rank

Latest revision as of 11:57, 14 June 2024

scientific article
Language Label Description Also known as
English
Automatic identification of embedded network rows in large-scale optimization models
scientific article

    Statements

    Automatic identification of embedded network rows in large-scale optimization models (English)
    0 references
    0 references
    0 references
    0 references
    1984
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    identification of embedded network rows
    0 references
    large-scale optimization
    0 references
    basis factorization
    0 references
    generalized upper bounds
    0 references
    polynomial boundedness
    0 references
    NP- hardness
    0 references
    exploitation of special structure
    0 references
    heuristic algorithms
    0 references
    maximum-size embedded pure network
    0 references