Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph Full article
Conference |
2019 15th International Asian School-Seminar Optimization Problems of Complex Systems 26-30 Aug 2019 , Новосибирск |
||||
---|---|---|---|---|---|
Source | 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS)
26-30 Aug. 2019 Compilation, IEEE. 2019. 212 c. |
||||
Output data | Year: 2019, Article number : 8880248, Pages count : 5 DOI: 10.1109/opcs.2019.8880248 | ||||
Tags | Capaciteted Facility Location Problem; line graph; NP-hard problem; pseudopolynomial-time algorithm; totally monotone matrix | ||||
Authors |
|
||||
Affiliations |
|
Cite:
Gimadi E.
, Shtepa A.
, Tsidulko O.
Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph
In compilation 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) 26-30 Aug. 2019. – IEEE., 2019. – C.53-57. DOI: 10.1109/opcs.2019.8880248 WOS Scopus OpenAlex
Improved Exact Algorithm for the Capacitated Facility Location Problem on a Line Graph
In compilation 15th International Asian School-Seminar Optimization Problems of Complex Systems (OPCS) 26-30 Aug. 2019. – IEEE., 2019. – C.53-57. DOI: 10.1109/opcs.2019.8880248 WOS Scopus OpenAlex
Identifiers:
Web of science: | WOS:000525749600011 |
Scopus: | 2-s2.0-85077985462 |
OpenAlex: | W2997395477 |