Affinity propagation and uncapacitated facility location problems (Q5964469): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient genetic algorithm for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: OCLUS: an analytic method for generating clusters with known overlap / 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: Integer Programming: Methods, Uses, Computations / 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: Selection of variables in cluster analysis: An empirical comparison of eight procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139967 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The heterogeneous \(p\)-median problem for categorization based clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable-selection heuristic for K-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal partitioning of a data set based on the \(p\)-median model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exemplar-based clustering via simulated annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of heuristic procedures for minimum within-cluster sums of squares partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical analysis of simulated annealing applied to the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search algorithm for the p-median problem / 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: Cluster Analysis: An Application of Lagrangian Relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Locating Sources Among Destinations / 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: Clustering by Passing Messages Between Data Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual-Bounded Algorithm for the <i>p</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method for solving to optimality uncapacitated location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / 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 / 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: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of two dual-based procedures for solving the p-median 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 search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Validation of subgradient optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A Branch-and-Bound Algorithm for Seeking the <i>P</i>-Median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Groups in Data / 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: Algorithms of ant system and simulated annealing for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4373483 / 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: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Algorithm for the <i>p</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Analysis and Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSPLIB—A Traveling Salesman Problem Library / 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: An efficient tabu search procedure for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initializing \(K\)-means batch clustering: A critical evaluation of several techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Poisson-based adaptive affinity propagation clustering for SAGE data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and the Theory of Grouping / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: apcluster / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ShapePheno / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MODEVO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00357-015-9187-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1955720280 / rank
 
Normal rank

Latest revision as of 12:51, 11 July 2024

scientific article; zbMATH DE number 6547228
Language Label Description Also known as
English
Affinity propagation and uncapacitated facility location problems
scientific article; zbMATH DE number 6547228

    Statements

    Affinity propagation and uncapacitated facility location problems (English)
    0 references
    0 references
    0 references
    29 February 2016
    0 references
    0 references
    clustering
    0 references
    exact algorithms
    0 references
    heuristics
    0 references
    simple plant location problem
    0 references
    affinity propagation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references