Irreducible Bin Packing › Research Explorer

Novosibirsk State University's Research Portal

Irreducible Bin Packing: Complexity, Solvability and Application to the Routing Open Shop

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Theoretical Cybernetics Section

DOI

https://doi.org/10.1007/978-3-030-38629-0_9
Final published version

Original language	English
Title of host publication	Learning and Intelligent Optimization - 13th International Conference, LION 13, Revised Selected Papers
Editors	Nikolaos F. Matsatsinis, Yannis Marinakis, Panos Pardalos
Publisher	Springer Gabler
Pages	106-120
Number of pages	15
ISBN (Print)	9783030386283
DOIs	https://doi.org/10.1007/978-3-030-38629-0_9
Publication status	Published - 22 Jan 2020
Event	13th International Conference on Learning and Intelligent Optimization - Chania, Greece Duration: 27 May 2019 → 31 May 2019 Conference number: 13

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	11968 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	13th International Conference on Learning and Intelligent Optimization
Abbreviated title	LION 13
Country/Territory	Greece
City	Chania
Period	27.05.2019 → 31.05.2019

Research areas

Bin packing to the maximum, Efficient normality, Irreducible Bin Packing, Job aggregation, Polynomially solvable subcase, Routing open shop, Superoverloaded node

ID: 23878267