Exact algorithms for the 0-1 time-bomb knapsack problem
Year of publication: |
2022
|
---|---|
Authors: | Monaci, Michele ; Pike-Burke, Ciara ; Santini, Alberto |
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. 145.2022, p. 1-10
|
Subject: | Knapsack Problem | Stochastic optimisation | Exact algorithms | Computational experiments | Algorithmus | Algorithm | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Integer optimization with penalized fractional values : the Knapsack case
Malaguti, Enrico, (2019)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
-
Exact approaches for the knapsack problem with setups
Furini, Fabio, (2018)
- More ...
-
The traveling salesman problem with pickups, deliveries, and draft limits
Malaguti, Enrico, (2018)
-
A branch-and-price approach to the feeder network design problem
Santini, Alberto, (2018)
-
An exact algorithm for the Partition Coloring Problem
Furini, Fabio, (2018)
- More ...