Irreducible bin packing and normality in routing open shop

Journal

Annals of Mathematics and Artificial Intelligence
ISSN: 1012-2443 , E-ISSN: 1573-7470

Output data

Year: 2021, Volume: 89, Number: 8-9, Pages: 899-918 Pages count : 20 DOI: 10.1007/s10472-021-09759-x

Tags

Computer-aided proof; Irreducible bin packing; Normality; Optima localization; Polynomially solvable subcases; Routing open shop

Authors

Chernykh Ilya ^1,2 , Pyatkin Artem ^1,2

Affiliations

1	Sobolev Institute of Mathematics, Koptyug ave. 4, Novosibirsk, 630090, Russia
2	Novosibirsk State University, Koptyug ave. 2, Novosibirsk, 630090, Russia

Chernykh I. , Pyatkin A.
Irreducible bin packing and normality in routing open shop
Annals of Mathematics and Artificial Intelligence. 2021. V.89. N8-9. P.899-918. DOI: 10.1007/s10472-021-09759-x WOS Scopus OpenAlex