A Lagrangean heuristic for the maximal covering location problem (Q1266569): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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/0377-2217(94)00159-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004389393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Large-scale Travelling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Single and Double Vertex Substitution in Heuristic Procedures for the <i>p</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated maximal covering location problem with backup service / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:35, 28 May 2024

scientific article
Language Label Description Also known as
English
A Lagrangean heuristic for the maximal covering location problem
scientific article

    Statements

    Identifiers