A new algorithm for the 0-1 Knapsack problem
Year of publication: |
1988
|
---|---|
Authors: | Martello, Silvano |
Other Persons: | Toth, Paolo (contributor) |
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. 34.1988, 5, p. 633-644
|
Subject: | Operations Research | Operations research | Mathematische Optimierung | Mathematical programming | Branch-and-Bound | Branch and Bound |
-
A branch-and-bound algorithm for the quadratic multiple knapsack problem
Fleszar, Krzysztof, (2022)
-
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
San Segundo, Pablo, (2019)
-
A branch-and-bound algortihm for the cell formation problem
Utkina, Irina E., (2018)
- More ...
-
Comments on: Routing problems with loading constraints
Toth, Paolo, (2010)
-
An algorithm for the bottleneck traveling salesman problem
Carpaneto, Giorgio, (1984)
-
Approximation schemes for the subset-sum problem : Survey and experimental analysis
Martello, Silvano, (1985)
- More ...