An upper bound for the zero-one knapsack problem and a branch and bound algorithm
| Year of publication: |
1977
|
|---|---|
| Authors: | Martello, Silvano ; Toth, Paolo |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 1.1977, 3, p. 169-175
|
| Subject: | Programmanalyse ganzzahlig | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming |
-
An efficient algorithm for the 0-1 Knapsack problem
Nauss, Robert M., (1976)
-
Neto, Teresa, (2013)
-
A branch and bound algorithm for a class of biobjective mixed integer programs
Stidsen, Thomas, (2014)
- More ...
-
Comments on: Routing problems with loading constraints
Toth, Paolo, (2010)
-
Comments on: Routing problems with loading constraints
Toth, Paolo, (2010)
-
New trends in exact algorithms for the 0-1 knapsack problem
Martello, Silvano, (2000)
- More ...