-
1
-
-
0003515463
-
-
Prentice Hall, Englewood Cliffs, NJ
-
Ahuja, R. K., Magnanti, T. L. and Orlin, J. B. (1993) Network flows: Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs, NJ.
-
(1993)
Network Flows: Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
2
-
-
0002224079
-
A new alternating basis algorithm for semi-assignment networks
-
Barr, R. S., Glover, F. and Klingman, D. (1977) A new alternating basis algorithm for semi-assignment networks. Mathematical Programming 13, 1-13.
-
(1977)
Mathematical Programming
, vol.13
, pp. 1-13
-
-
Barr, R.S.1
Glover, F.2
Klingman, D.3
-
3
-
-
0010651332
-
A network-flow model for racially balancing schools
-
Belford, P. C. and Ratliff, D. H. (1972) A network-flow model for racially balancing schools. Operations Research 20, 619-628.
-
(1972)
Operations Research
, vol.20
, pp. 619-628
-
-
Belford, P.C.1
Ratliff, D.H.2
-
5
-
-
0042220823
-
An operations research approach to racial desegregation of school systems
-
Clarke, S. H. and Surkis, J. (1968) An operations research approach to racial desegregation of school systems. Journal of Socio-economic Planning 1, 259-272.
-
(1968)
Journal of Socio-economic Planning
, vol.1
, pp. 259-272
-
-
Clarke, S.H.1
Surkis, J.2
-
6
-
-
0001391104
-
Decomposition principle for linear programs
-
Dantzig, G. B. and Wolfe, P. (1961) Decomposition principle for linear programs. Operations Research 8, 101-111.
-
(1961)
Operations Research
, vol.8
, pp. 101-111
-
-
Dantzig, G.B.1
Wolfe, P.2
-
8
-
-
0001424107
-
Constructing maximal dynamic plows from static flows
-
Ford, L. R. and Fulkerson, D. R. (1958) Constructing maximal dynamic plows from static flows. Operations Research 6, 419-433.
-
(1958)
Operations Research
, vol.6
, pp. 419-433
-
-
Ford, L.R.1
Fulkerson, D.R.2
-
9
-
-
0041720468
-
Computed school assignments in a large district
-
Franklin, A. D. and Koenigsberg, E. (1973) Computed school assignments in a large district. Operations Research 21, 413-426.
-
(1973)
Operations Research
, vol.21
, pp. 413-426
-
-
Franklin, A.D.1
Koenigsberg, E.2
-
10
-
-
85030048139
-
-
Technical Report 89-CSE-34, Department of Mathematical Sciences, Southern Methodist University, Dallas
-
Kennington, J. L. and Wang, Z. (1989) A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem. Technical Report 89-CSE-34, Department of Mathematical Sciences, Southern Methodist University, Dallas.
-
(1989)
A Shortest Augmenting Path Algorithm for the Semi-assignment Problem
-
-
Kennington, J.L.1
Wang, Z.2
-
11
-
-
0020018548
-
Algorithms for the school distracting problem. Memoirs of the Faculty of Engineering
-
Mine, H., Ohno, K. and Miyaji, I. (1982) Algorithms for the school distracting problem. Memoirs of the Faculty of Engineering. Kyoto University 44, 168-181.
-
(1982)
Kyoto University
, vol.44
, pp. 168-181
-
-
Mine, H.1
Ohno, K.2
Miyaji, I.3
-
12
-
-
85030039699
-
School Facility Needs: Background Information for Recommendations
-
Houston Independent School District Report, Houston
-
Petruzielo, F. R. (1994) 1993-1994 School Facility Needs: Background Information for Recommendations. Houston Independent School District Report, Houston.
-
(1994)
1993-1994
-
-
Petruzielo, F.R.1
|