An algorithm for large zero-one knapsack problems
| Year of publication: |
1980
|
|---|---|
| Authors: | Balas, Egon ; Zemel, Eitan |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 28.1980, 5, p. 1130-1154
|
| Subject: | Ganzzahlig Programmanalyse | Algorithmus | Algorithm | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Consistency cuts for Dantzig-Wolfe reformulations
Clausen, Jens Vinther, (2022)
-
Models for the two-dimensional level strip packing problem : a review and a computational evaluation
Bezerra, Vanessa M. R., (2020)
-
MILP models for complex system reliability redundancy allocation with mixed components
Park, Young Woong, (2020)
- More ...
-
Lifting and complementing yields all the facets of positive zero one programming polytopes
Balas, Egon, (1984)
-
Erratum: Critical Cutsets of Graphs and Canonical Facets of Set Packing Polytopes
Balas, Egon, (1998)
-
The dual method for the generalized transportation problem
Balas, Egon, (1966)
- More ...