Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem
Year of publication: |
2007
|
---|---|
Authors: | Büther, Marcel ; Briskorn, Dirk |
Publisher: |
Kiel : Inst. für Betriebswirtschaftslehre |
Subject: | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Theorie | Theory |
-
Bin packing problem with time lags
Rivera Letelier, Orlando, (2022)
-
Neto, Teresa, (2013)
-
A branch and bound algorithm for a class of biobjective mixed integer programs
Stidsen, Thomas, (2014)
- More ...
-
Büther, Marcel, (2007)
-
Büther, Marcel, (2007)
-
Reducing the elastic generalized assignment problem to the standard generalized assignment problem
Büther, Marcel, (2007)
- More ...