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 |
-
Ozturk, Onur, (2017)
-
A binary branch and bound algorithm to minimize maximum scheduling cost
Chandra, Charu, (2014)
-
Branch and bound algorithms for the bus evacuation problem
Goerigk, Marc, (2013)
- More ...
-
An Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem
Martello, Silvano, (2003)
-
Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Martello, Silvano, (1997)
-
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
Fischetti, Matteo, (2001)
- More ...