Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta (Q4022744): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection method for the uncapacitated facility location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Based Procedure for Uncapacitated Facility Location / 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 application-oriented guide for designing Lagrangean dual ascent algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the fixed cost median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple plant location problem: Survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02888252 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1533553764 / rank
 
Normal rank

Latest revision as of 10:12, 30 July 2024

scientific article
Language Label Description Also known as
English
Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta
scientific article

    Statements

    Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta (English)
    0 references
    17 January 1993
    0 references
    simple plant location
    0 references
    generalized \(p\)-median
    0 references
    heuristic algorithms
    0 references
    Lagrangian decomposition
    0 references
    subgradient optimization
    0 references

    Identifiers

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