An aggregation heuristic for large scale p-median problem (Q1762151): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An effective heuristic for large-scale capacitated facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of large-scale \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics for location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the \(p\)-median problem with a semi-Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Method for the Set Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation Error Bounds for a Class of Location Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case incremental analysis for a class ofp-facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster analysis and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic supply chain design with inventory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>p</i>-Median Problem for Cluster Analysis: A Comparative Test Using the Mixture Model Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p\)-median problem: a survey of metaheuristic approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis: An Application of Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach to \(p\)-median location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic methods for large centroid clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank

Latest revision as of 22:08, 5 July 2024

scientific article
Language Label Description Also known as
English
An aggregation heuristic for large scale p-median problem
scientific article

    Statements

    An aggregation heuristic for large scale p-median problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    \(p\)-median problem
    0 references
    clustering analysis
    0 references
    Lagrangean relaxation
    0 references
    core heuristic
    0 references
    aggregation procedure
    0 references
    0 references
    0 references
    0 references