Construction Line Algorithms for the Connection Location-Allocation Problem (Q5391943): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Allocation search methods for a generalized class of location-allocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient solution method for Weber problems with barriers based on genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location-Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4532026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometrical properties of the Fermat-Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Set of Optimal Points to the Weber Problem: Further Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Weber location problems with barriers and block norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-connection location problem in a plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hull properties in location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems / rank
 
Normal rank

Latest revision as of 23:32, 3 July 2024

scientific article; zbMATH DE number 5875916
Language Label Description Also known as
English
Construction Line Algorithms for the Connection Location-Allocation Problem
scientific article; zbMATH DE number 5875916

    Statements