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 |
-
On a pair of nonlinear mixed integer programming problems
Miehra, M. S., (1985)
-
An intersection cut from the dual of the unit haypercube
Balas, Egon, (1971)
-
An algorithm for set partitioning
Balas, Egon, (1975)
- 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 perfectly matchable subgraph polytope of an arbitrary graph
Balas, Egon, (1987)
- More ...