A matheuristic for large-scale capacitated clustering (Q2668749): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MNIST / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: AP-library / 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.1016/j.cor.2021.105304 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2987536913 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Density based problem space search for the capacitated clustering \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy random adaptive memory programming search for the capacitated clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An aggregation heuristic for large scale p-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new method for solving capacitated location problems based on a set partitioning approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional binary search trees used for associative searching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the capacitated clustering problem with variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐price algorithm for the capacitated <i>p</i>‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive GRASP with path relinking for capacitated clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid scatter search and path relinking for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of aggregation errors for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of different formulations for the capacitated discrete ordered median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective VNS for the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid genetic algorithms with selective crossover for the capacitated \(p\)-Median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach to capacitated \(p\)-median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model-based capacitated clustering with posterior regularization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bionomic approach to the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated centred clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided construction search metaheuristics for the capacitated p-median problem with single source constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated clustering problems by hybrid simulated annealing and tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and portfolio selection problems: a unified framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A location-allocation-improvement heuristic for districting with multiple-activity balancing constraints and \(p\)-median-based dispersion minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search heuristic for the capacitated clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics for the capacitated p‐median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic search to the capacitated clustering problem / rank
 
Normal rank

Latest revision as of 05:12, 28 July 2024

scientific article
Language Label Description Also known as
English
A matheuristic for large-scale capacitated clustering
scientific article

    Statements

    A matheuristic for large-scale capacitated clustering (English)
    0 references
    0 references
    7 March 2022
    0 references
    large-scale capacitated clustering
    0 references
    capacitated \(p\)-median problem
    0 references
    capacitated centered clustering problem
    0 references
    binary linear programming
    0 references
    matheuristic
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers