Reducibility of minimax to minisum 0-1 programming problems (Q1148229): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An algebraic approach to assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083324 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Medi-Centers of a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3316922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Families of Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Backboard Wiring Problem: A Placement Algorithm / rank
 
Normal rank

Latest revision as of 10:15, 13 June 2024

scientific article
Language Label Description Also known as
English
Reducibility of minimax to minisum 0-1 programming problems
scientific article

    Statements

    Reducibility of minimax to minisum 0-1 programming problems (English)
    0 references
    0 references
    0 references
    1981
    0 references
    reducibility of minimax
    0 references
    minisum
    0 references
    minimax objective function
    0 references
    linear minisum problem
    0 references
    locational decision models
    0 references
    algorithm
    0 references
    p-center
    0 references
    p- median
    0 references
    location
    0 references
    logistics
    0 references

    Identifiers