A hybrid method for the probabilistic maximal covering location-allocation problem (Q337483): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2014.12.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083487387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The inventory-routing problem with transshipment / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition approach for the probabilistic maximal covering location-allocation problem / 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: Location science research: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of five heuristics for the multiple depot vehicle scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation approach for the maximal covering location problem / 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: A unified heuristic for a large class of vehicle routing problems with backhauls / rank
 
Normal rank

Latest revision as of 21:53, 12 July 2024

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

    Statements

    A hybrid method for the probabilistic maximal covering location-allocation problem (English)
    0 references
    10 November 2016
    0 references
    facility location
    0 references
    congested systems
    0 references
    hybrid algorithm
    0 references
    adaptive large neighborhood search
    0 references
    exact method
    0 references
    queueing maximal covering location-allocation model
    0 references
    pmclap
    0 references
    0 references
    0 references
    0 references

    Identifiers