A branch-and-price algorithm for the multiple knapsack problem
Year of publication: |
2022
|
---|---|
Authors: | Lalonde, Olivier ; Côté, Jean-François ; Gendron, Bernard |
Published in: |
INFORMS journal on computing : JOC ; charting new directions in operations research and computer science ; a journal of the Institute for Operations Research and the Management Sciences. - Linthicum, Md. : INFORMS, ISSN 1526-5528, ZDB-ID 2004082-9. - Vol. 34.2022, 6, p. 3134-3150
|
Subject: | branch-and-price | Lagrangian relaxation | multiple knapsack problem | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming | Beziehungsmarketing | Relationship marketing | Branch-and-Bound | Branch and Bound |
-
A branch-and-price algorithm for the Multiple Knapsack Problem
Lalonde, Olivier, (2021)
-
Tönissen, D. D., (2017)
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
- More ...
-
A branch-and-price algorithm for the Multiple Knapsack Problem
Lalonde, Olivier, (2021)
-
A novel reformulation for the single-sink fixed charge transportation problem
Legault, Robin, (2022)
-
A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
Côté, Jean-François, (2009)
- More ...