An iterative algorithm for the max-min knapsack problem with multiple scenarios
Year of publication: |
2021
|
---|---|
Authors: | Al-douri, Thekra ; Hifi, Mhand ; Zissimopoulos, Vassilis |
Subject: | Heuristic | Knapsack | Neighborhood | Optimization | Path-relinking | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | 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)
-
A random search algorithm for cyclic delivery synchronization problem
Gdowska, Katarzyna, (2017)
- 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)
-
C OPTIMAL ALLOCATION - A simulated annealing approach for the circular cutting problem Cf:150
Paschos, Vangelis Th, (2005)
- More ...