Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region. (Q2477119): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria single facility rectilinear location problems in the presence of a single forbidden region / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Direct Search'' Solution of Numerical and Statistical Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding shortest paths in the plane in the presence of barriers to travel (for any \(l_ p\)-norm) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location problems in the presence of two-circular forbidden regions with Euclidean distance norm. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:20, 27 June 2024

scientific article
Language Label Description Also known as
English
Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region.
scientific article

    Statements

    Facility location problems in the presence of single convex/non-convex polygonal barrier/forbidden region. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 March 2008
    0 references
    0 references
    facility location
    0 references
    convex/non-convex
    0 references
    forbidden regions
    0 references
    unconstrained path
    0 references
    Euclidean norm
    0 references
    mini-sum criteria
    0 references
    Hook and Jeeves method
    0 references