A decomposition approach for multidimensional knapsacks with family‐split penalties-Reference-Cited by-同舟云学术

A decomposition approach for multidimensional knapsacks with family‐split penalties

Published:2022-09-08 Issue: Volume: Page:
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Mancini Simona¹²,Meloni Carlo³^ORCID,Ciavotta Michele⁴

Affiliation:

1. Department of Operations Energy, and Environmental Management University of Klagenfurt Klagenfurt Austria

2. Dipartimento di Ingegneria Università di Palermo Palermo Italy

3. Dipartimento di Ingegneria Informatica Automatica e Gestionale Sapienza Università di Roma Rome Italy

4. Dipartimento di Informatica Sistemistica e Comunicazione Università di Milano‐Bicocca Milan Italy

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1111/itor.13207

Reference42 articles.

1. All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns

2. A Lagrangean based solution algorithm for the knapsack problem with setups

3. A Lagrangean based solution algorithm for the multiple knapsack problem with setups;Amiri A.;Computers & Industrial Engineering,2021

4. Partitioning procedures for solving mixed-variables programming problems

5. The multi‐period multi‐trip container drayage problem with release and due dates;Bruglieri M.;Computers & Operations Research,2021

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. An exact algorithm for the multiple-choice Knapsack problem with setups;Computers & Industrial Engineering;2024-02

2. Combining local branching and descent method for solving the multiple‐choice knapsack problem with setups;International Transactions in Operational Research;2023-05-30