An intersection cut from the dual of the unit haypercube
Year of publication: |
1971
|
---|---|
Authors: | Balas, Egon |
Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 19.1971, 1, p. 40-44
|
Subject: | Ganzzahlig Programmanalyse |
-
On a pair of nonlinear mixed integer programming problems
Miehra, M. S., (1985)
-
An algorithm for large zero-one knapsack problems
Balas, Egon, (1980)
-
An algorithm for set partitioning
Balas, Egon, (1975)
- More ...
-
The perfectly matchable subgraph polytope of an arbitrary graph
Balas, Egon, (1987)
-
The perfectly matchable subgraph polytope of a bipartite graph
Balas, Egon, (1981)
-
Job shop scheduling with setup times, deadlines and precedence constraints
Balas, Egon, (2008)
- More ...