An effective VNS for the capacitated \(p\)-median problem (Q932177): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2006.12.055 / rank
Normal rank
 
Property / author
 
Property / author: Krzysztof Fleszar / rank
Normal rank
 
Property / author
 
Property / author: Khalil S. Hindi / rank
Normal rank
 
Property / author
 
Property / author: Krzysztof Fleszar / rank
 
Normal rank
Property / author
 
Property / author: Khalil S. Hindi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-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.ejor.2006.12.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085399058 / 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: A new method for solving capacitated location problems based on a set partitioning approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic and adaptive memory procedure for political districting / 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: Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Efficient solution of large scale, single-source, capacitated plant location problems / 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: A bionomic approach to the capacitated \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving capacitated clustering problems / 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: A scatter search heuristic for the capacitated clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A path relinking approach with ejection chains for the generalized assignment problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2006.12.055 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:39, 10 December 2024

scientific article
Language Label Description Also known as
English
An effective VNS for the capacitated \(p\)-median problem
scientific article

    Statements

    An effective VNS for the capacitated \(p\)-median problem (English)
    0 references
    10 July 2008
    0 references
    variable neighbourhood search
    0 references
    capacitated \(p\)-median problem
    0 references
    capacitated clustering problem
    0 references
    hybrid heuristics
    0 references
    0 references
    0 references

    Identifiers