Combining local branching and descent method for solving the multiple-choice knapsack problem with setups
Year of publication: |
2024
|
---|---|
Authors: | Boukhari, Samah ; Hifi, Mhand |
Published in: |
International transactions in operational research : a journal of the International Federation of Operational Research Societies. - Oxford : Wiley-Blackwell, ISSN 1475-3995, ZDB-ID 2019815-2. - Vol. 31.2024, 1, p. 29-52
|
Subject: | branching | computational methods | learning | optimization | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming |
-
Numerically safe lower bounds for the capacitated vehicle routing problem
Fukasawa, Ricardo, (2017)
-
Optimization-driven scenario grouping
Ryan, Kevin, (2020)
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
- More ...
-
Beam search-based algorithms for the circular packing problem.
Akeb, Hakim, (2007)
-
An exact algorithm for the multiple-choice multidimensional knapsack problem.
Hifi, Mhand, (2004)
-
Strip generation algorithms for constrained two-dimensional two-staged cutting problems
Hifi, Mhand, (2006)
- More ...