Pareto-Based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem Full article
Conference |
18th International conference on mathematical optimization theory and operations research 08-12 Jul 2019 , Екатеринбург |
||||
---|---|---|---|---|---|
Source | Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings Compilation, Springer. 2019. 716 c. ISBN 978-3-030-22628-2. |
||||
Output data | Year: 2019, Volume: 11548, Pages: 358–373 Pages count : DOI: 10.1007/978-3-030-22629-9_25 | ||||
Authors |
|
||||
Affiliations |
|
Cite:
Kovalenko Y.V.
, Zakharov A.O.
Pareto-Based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem
In compilation Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.358–373. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_25 OpenAlex
Pareto-Based Hybrid Algorithms for the Bicriteria Asymmetric Travelling Salesman Problem
In compilation Mathematical Optimization Theory and Operations Research. 18th International Conference, MOTOR 2019, Ekaterinburg, Russia, July 8-12, 2019, Proceedings. – Springer., 2019. – Т.Lecture Notes in Computer Science. Vol. 11548.. – C.358–373. – ISBN 978-3-030-22628-2. DOI: 10.1007/978-3-030-22629-9_25 OpenAlex
Dates:
Published online: | Jun 19, 2019 |
Identifiers:
OpenAlex: | W2950906723 |
Citing:
Пока нет цитирований