A decomposition approach for the probabilistic maximal covering location-allocation problem (Q1017444): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2008.11.015 / 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.2008.11.015 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2016100020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hierarchical Service Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical location-allocation models for congested systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lagrangean heuristic for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location science research: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum Availability Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The queueing maximal availability location problem: A model for the siting of emergency vehicles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ambulance location and relocation models. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximal Covering Location Problem with Capacities on Total Workload / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Artificial Intelligence – SBIA 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evolutionary Computation in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing the woodpulp stowage using Lagrangean relaxation with clusters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation with clusters and column generation for the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean relaxation with clusters for point-feature cartographic label placement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict graphs in solving integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Primer in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-price approach to \(p\)-median location problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2008.11.015 / rank
 
Normal rank

Latest revision as of 13:05, 10 December 2024

scientific article
Language Label Description Also known as
English
A decomposition approach for the probabilistic maximal covering location-allocation problem
scientific article

    Statements

    A decomposition approach for the probabilistic maximal covering location-allocation problem (English)
    0 references
    19 May 2009
    0 references
    location problems
    0 references
    Lagrangian relaxation
    0 references
    congested systems
    0 references
    column generation
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers