Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Optimization methods for knapsack and tool switching problems

Optimization methods for knapsack and tool switching problems 4OR https://doi.org/10.1007/s10288-023-00543-7 PHD THESIS Optimization methods for knapsack and tool switching problems Alberto Locatelli © Springer-Verlag GmbH Germany, part of Springer Nature 2023 This is a summary of the author’s Ph.D. thesis supervised by Manuel Iori (Univer- sità degli Studi di Modena e Reggio Emilia) and Valentina Cacchiani (Università di Bologna) and defended on March 23, 2023, at the Università degli Studi di Modena e Reggio Emilia. This thesis is written in English and is available from the author upon request at alberto.locatelli@unimore.it. The thesis deals with two different classes of optimization problems: Knapsack Problems (KPs) and Tool Switching Problems (ToSPs), with the pursuit of two main objectives. First, we aim to provide a comprehensive overview of recent advances made in the field of KPs after 2004, the publication year of the latter volume of the two classical books dedicated to KPs. The second objective is motivated by a real- world application in the color printing industry and consists in studying and solving new variants of the ToSP. The thesis begins with an extensive treatment of classical single KPs and their variants. Thus, besides the well-known binary, subset sum, bounded, unbounded, and change-making KPs, we review KPs with special http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png 4OR Springer Journals

Optimization methods for knapsack and tool switching problems

Locatelli, Alberto
4OR , Volume OnlineFirst – May 20, 2023
Download PDF
2 pages

Loading next page...
 
/lp/springer-journals/optimization-methods-for-knapsack-and-tool-switching-problems-XeJW0YEN8z

References (0)

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Springer Journals
Copyright
Copyright © Springer-Verlag GmbH Germany, part of Springer Nature 2023
ISSN
1619-4500
eISSN
1614-2411
DOI
10.1007/s10288-023-00543-7
Publisher site
See Article on Publisher Site

Abstract

4OR https://doi.org/10.1007/s10288-023-00543-7 PHD THESIS Optimization methods for knapsack and tool switching problems Alberto Locatelli © Springer-Verlag GmbH Germany, part of Springer Nature 2023 This is a summary of the author’s Ph.D. thesis supervised by Manuel Iori (Univer- sità degli Studi di Modena e Reggio Emilia) and Valentina Cacchiani (Università di Bologna) and defended on March 23, 2023, at the Università degli Studi di Modena e Reggio Emilia. This thesis is written in English and is available from the author upon request at alberto.locatelli@unimore.it. The thesis deals with two different classes of optimization problems: Knapsack Problems (KPs) and Tool Switching Problems (ToSPs), with the pursuit of two main objectives. First, we aim to provide a comprehensive overview of recent advances made in the field of KPs after 2004, the publication year of the latter volume of the two classical books dedicated to KPs. The second objective is motivated by a real- world application in the color printing industry and consists in studying and solving new variants of the ToSP. The thesis begins with an extensive treatment of classical single KPs and their variants. Thus, besides the well-known binary, subset sum, bounded, unbounded, and change-making KPs, we review KPs with special

Journal

4OR – Springer Journals

Published: May 20, 2023

There are no references for this article.