An empirical analysis of exact algorithms for the unbounded knapsack problem
Year of publication: |
2019
|
---|---|
Authors: | Becker, Henrique ; Buriol, Luciana S. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 277.2019, 1 (16.8.), p. 84-99
|
Subject: | Combinatorial optimization | Unbounded knapsack problem | Dynamic programming | Integer programming | Branch and bound | Ganzzahlige Optimierung | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Dynamische Optimierung | Branch-and-Bound | Branch and Bound |
-
Exact approaches for the unconstrained two-dimensional cutting problem with defects
Zhang, Hao, (2023)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
-
Branch-and-bound and dynamic programming approaches for the knapsack problem
Burashnikov, Evgenii, (2024)
- More ...
-
Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
Becker, Henrique, (2024)
-
Speeding Up Dynamic Shortest-Path Algorithms
Buriol, Luciana S., (2008)
-
A biased random-key genetic algorithm for road congestion minimization
Buriol, Luciana S., (2010)
- More ...