A graph-theoretic approach to a class of integer-programming problems
| Year of publication: |
1969
|
|---|---|
| Authors: | Desler, J. F. ; Hakimi, S. L. |
| Published in: |
Operations research. - Catonsville, MD : INFORMS, ISSN 0030-364X, ZDB-ID 123389-0. - Vol. 17.1969, 6, p. 1017-1033
|
| 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 ...
-
Optimum locations of switching centers and the absolute centers and medians of a graph
Hakimi, S. L., (1964)
-
Approximation algorithms for the capacitated plant allocation problem
Labbé, Martine, (1992)
-
Hakimi, S. L., (1978)
- More ...