Sciact
  • EN
  • RU

An upper bound for the competitive location and capacity choice problem with multiple demand scenarios Full article

Journal Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797
Output data Year: 2017, Volume: 11, Number: 4, Pages: 472-480 Pages count : 9 DOI: 10.1134/S1990478917040020
Tags bilevel programming; competitive facility location; upper bound
Authors Beresnev V.L. 1,2 , Melnikov A.A 1,2
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Beresnev V.L. , Melnikov A.A.
An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
Journal of Applied and Industrial Mathematics. 2017. V.11. N4. P.472-480. DOI: 10.1134/S1990478917040020 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85036458617
OpenAlex: W2769316809
Citing:
DB Citing
Scopus 3
OpenAlex 3
Altmetrics: