Successive computation of some efficient locations of the Weber problem with barriers (Q2511354): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Mathematica / rank
 
Normal rank
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/s12190-012-0637-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071935600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel / 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: The multi-facility location-allocation problem with polyhedral barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for facility location in the presence of forbidden regions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location problems with costs being sums of powers of Euclidean distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar location problems with block distance and barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cellular heuristic for the multisource Weber problem. / 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: Q4865765 / 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: Planar weber location problems with line barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction result for location problems with polyhedral barriers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4788111 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic properties of location problems with one circular barrier. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Region-rejection based heuristics for the capacitated multi-source Weber problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency in multiple objective optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4229604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4244407 / rank
 
Normal rank

Latest revision as of 19:59, 8 July 2024

scientific article
Language Label Description Also known as
English
Successive computation of some efficient locations of the Weber problem with barriers
scientific article

    Statements

    Successive computation of some efficient locations of the Weber problem with barriers (English)
    0 references
    5 August 2014
    0 references
    Weber problem with barriers
    0 references
    efficient locations
    0 references
    distance metrics
    0 references
    \texttt{MATHEMATICA}
    0 references

    Identifiers