The discrete p-maxian location problem (Q1824542): 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.1016/0305-0548(90)90027-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031426424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Maxmin Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical models for locating undesirable facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating an undesirable facility with a minimax criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867320 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location on Tree Networks: <i>P</i>-Centre and <i>n</i>-Dispersion Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality and Distance Constraints for the Nonlinear <i>p</i>-Center Problem and Covering Problem on a Tree Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Network Location Problems with Distance Constraints / rank
 
Normal rank

Latest revision as of 11:00, 20 June 2024

scientific article
Language Label Description Also known as
English
The discrete p-maxian location problem
scientific article

    Statements