An improved binary search algorithm for the multiple-choice knapsack problem
Year of publication: |
October-December 2016
|
---|---|
Authors: | He, Cheng ; Leung, Josheph Y.-T. ; Lee, Kangbok ; Pinedo, Michael |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 50.2016, 4/5, p. 995-1001
|
Subject: | Multiple-Choice Knapsack Problem (MCKP) | Approximate binary search algorithm | Worst-case performance ratio | Multiple-choice Multi-dimensional Knapsack Problem (MMKP) | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
- More ...
-
Improved algorithms for single machine scheduling with release dates and rejections
He, Cheng, (2016)
-
Scheduling equal length jobs with eligibility restrictions
Hong, Juntaek, (2020)
-
Online scheduling of ordered flow shops
Lee, Kangbok, (2019)
- More ...