Relaxation-based algorithms for minimax optimization problems with resource allocation applications (Q1332312): Difference between revisions

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01582580 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071095524 / rank
 
Normal rank

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Relaxation-based algorithms for minimax optimization problems with resource allocation applications
scientific article

    Statements

    Relaxation-based algorithms for minimax optimization problems with resource allocation applications (English)
    0 references
    0 references
    0 references
    0 references
    31 January 1995
    0 references
    resource allocation
    0 references
    relaxation approach
    0 references
    minimax optimization
    0 references
    relaxation-based algorithms
    0 references
    simplex method
    0 references
    Farkas multipliers
    0 references
    knapsack type constraints
    0 references
    max-flow algorithm
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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