An efficient algorithm for the 0-1 Knapsack problem
| Year of publication: |
1976
|
|---|---|
| Authors: | Nauss, Robert M. |
| Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 23.1976, 1, p. 27-31
|
| Subject: | Programmanalyse ganzzahlig | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
-
Exact approaches for the knapsack problem with setups
Furini, Fabio, (2018)
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
On the use of internal rate of return in linear and integer programming
Nauss, Robert M., (1988)
-
True interest cost in municipal bond bidding : an integer programming approach
Nauss, Robert M., (1986)
-
Generating optimal true interest cost bids for new municipal bond competitive issues
Nauss, Robert M., (1987)
- More ...