Sciact
  • EN
  • RU

On Complexity and Exact Solution of Production Groups Formation Problem Full article

Conference 9th International Conference on Optimization and Applications
01-05 Oct 2018 , Petrovac
Source Optimization and Applications. OPTIMA 2018. Communications in Computer and Information Science
Compilation, Springer. Cham.2018. ISBN 978-3-030-10933-2.
Output data Year: 2019, Pages: 111-122 Pages count : 12 DOI: 10.1007/978-3-030-10934-9_8
Tags Branch and bound algorithm; Integer programming; Optimization on graphs; Production groups
Authors Eremeev Anton 2 , Kononov Alexander 1 , Ziegler Igor 2
Affiliations
1 Sobolev Institute of Mathematics
2 Омский филиал ФГБУН «Институт математики им. С.Л. Соболева СО РАН».
Cite: Eremeev A. , Kononov A. , Ziegler I.
On Complexity and Exact Solution of Production Groups Formation Problem
In compilation Optimization and Applications. OPTIMA 2018. Communications in Computer and Information Science. – Springer., 2019. – Т.974. – C.111-122. – ISBN 978-3-030-10933-2. DOI: 10.1007/978-3-030-10934-9_8 Scopus OpenAlex
Identifiers:
Scopus: 2-s2.0-85061177708
OpenAlex: W2911008320
Citing: Пока нет цитирований
Altmetrics: