Exact approaches for the knapsack problem with setups
Year of publication: |
February 2018
|
---|---|
Authors: | Furini, Fabio ; Monaci, Michele ; Traversi, Emiliano |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 90.2018, p. 208-220
|
Subject: | Knapsack problems | Column generation | Relaxations | Branch-and-bound algorithms | Computational experiments | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Operations Research | Operations research |
-
Algorithmic approaches to the multiple knapsack assignment problem
Martello, Silvano, (2019)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
- More ...
-
Furini, Fabio, (2019)
-
Decomposition methods for hard optimization problems
Furini, Fabio, (2020)
-
Preface: decompostion methods for hard optimization problems
Furini, Fabio, (2020)
- More ...