A bounding minimization problem for primal integer programming
| Year of publication: |
1974
|
|---|---|
| Authors: | Arnold, Larry R. ; Bellmore, Mandell |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 22.1974, 2, p. 383-392
|
| Subject: | Programmanalyse ganzzahlig |
-
A heuristic algorithm for a pseudo-cyclic delivery problem under window constraints
Palleta, Giuseppe, (1987)
-
Solving 0-1 integer programming problems arising from large scale planning models
Johnson, Ellis L., (1985)
-
A new Lagrangian relaxation approach to the generalized assignment problem
Jörnsten, Kurt, (1986)
- More ...
-
A generated out for primal integer programming
Arnold, Larry R., (1974)
-
Iteration skipping in primal integer programming
Arnold, Larry R., (1974)
-
[Besprechung von:] Bridge, J. and J. C. Dodds: Managerial decision making. [London] 1975
Arnold, Larry R., (1976)
- More ...