\((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
(3 intermediate revisions by 3 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91D30 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A65 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6651760 / rank
 
Normal rank
Property / zbMATH Keywords
 
location
Property / zbMATH Keywords: location / rank
 
Normal rank
Property / zbMATH Keywords
 
competitive location
Property / zbMATH Keywords: competitive location / rank
 
Normal rank
Property / zbMATH Keywords
 
centroid
Property / zbMATH Keywords: centroid / rank
 
Normal rank
Property / zbMATH Keywords
 
edge demand
Property / zbMATH Keywords: edge demand / rank
 
Normal rank
Property / zbMATH Keywords
 
bilevel programming
Property / zbMATH Keywords: bilevel programming / 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.1016/j.cor.2012.02.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042151987 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 02:20, 20 March 2024

scientific article
Language Label Description Also known as
English
\((r|p)\)-centroid problems on networks with vertex and edge demand
scientific article

    Statements

    \((r|p)\)-centroid problems on networks with vertex and edge demand (English)
    0 references
    0 references
    0 references
    11 November 2016
    0 references
    location
    0 references
    competitive location
    0 references
    centroid
    0 references
    edge demand
    0 references
    bilevel programming
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references