Solving the maximal covering location problem with heuristic concentration (Q2384889): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: Testing for Vision Loss in Glaucoma Suspects / 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 Lagrangean heuristic for the maximal covering location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration: Two stage solution construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration and tabu search: A head to head comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: A gamma heuristic for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank

Revision as of 09:49, 27 June 2024

scientific article
Language Label Description Also known as
English
Solving the maximal covering location problem with heuristic concentration
scientific article

    Statements

    Identifiers