An iterative algorithm for the max-min knapsack problem with multiple scenarios
Year of publication: |
2021
|
---|---|
Authors: | Al-douri, Thekra ; Hifi, Mhand ; Zissimopoulos, Vassilis |
Published in: |
Operational research : an international journal. - Berlin : Springer, ISSN 1866-1505, ZDB-ID 2425760-6. - Vol. 21.2021, 2, p. 1355-1392
|
Subject: | Heuristic | Knapsack | Neighborhood | Optimization | Path-relinking | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Algorithmus | Algorithm |
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
-
The blockwise coordinate descent method for integer programs
Jäger, Sven Joachim, (2020)
-
Randomized decomposition solver with the quadratic assignment problem as a case study
Mihić, Krešimir, (2018)
- More ...
-
A simulated annealing approach for the circular cutting problem
Hifi, Mhand, (2004)
-
A simulated annealing approach for the circular cutting problem
Hifi, Mhand, (2004)
-
Calibrations scheduling with arbitrary lengths and activation length
Angel, Eric, (2021)
- More ...