Minisum location problem with farthest Euclidean distances (Q857948): Difference between revisions

From MaRDI portal
Added link to MaRDI 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.1007/s00186-006-0084-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032560508 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minisum location with closest Euclidean distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating facilities by minimax relative to closest points of demand areas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized Weber problem with expected distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Weber problem with regional demand / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of regional facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for a Constrained Weber Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4865357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of Constrained Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to Location Models Involving Sets as Existing Facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of facilities with rectangular distances among point and area destinations / rank
 
Normal rank

Latest revision as of 11:55, 25 June 2024

scientific article
Language Label Description Also known as
English
Minisum location problem with farthest Euclidean distances
scientific article

    Statements

    Minisum location problem with farthest Euclidean distances (English)
    0 references
    0 references
    0 references
    5 January 2007
    0 references
    0 references
    constrained Weber problem
    0 references
    fixed region
    0 references
    bound test
    0 references
    greedy choice
    0 references
    choice of starting point
    0 references
    0 references