|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
ARPANET Resource Handbook Defense Communications Agency, Stanford Research Institute, Stanford, Calif., Dec 1976.
|
| |
2
|
CORNUFJOLS, G, FISHER, M L, AND NEMHAUSER, G.L Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms. Management So. 23, 8 (1977), 789-810.
|
| |
3
|
ELAM, J A model for distributing a database. Decision Sciences Working Paper, Univ of Pennsylvania, Philadelphia, Pa., March 1978.
|
| |
4
|
ELAM, J, AND STUTZ, J Some considerations and models for the distribution of a data base. Res Rep. CCS 279, Umv of Texas, Austin, Texas, May 1976
|
| |
5
|
ERLENKOTTER, D A dual-based procedure for uncapacltated facility location Working Paper 261, Western Management Science Institute, Untv of Cahforma, Los Angeles, Cahf, Nov. 1976.
|
| |
6
|
FISHER, M L Lagranglan relaxation method for solving integer programming problems. Decision Sciences Working Paper 80-06-07, The Wharton School, Univ. of Pennsylvania, Pittsburgh, Pa., May 1980 To appear m Management Scl.
|
| |
7
|
FISHER, M L., NEMHAUSER, G L, AND WOLSEY, L A An analys~s of approximations for maximizing submodular set functions, i1. To appear m Mathematical Prog
|
| |
8
|
FISHER, M.L, NORTHRUP, W D, AND SHAPIRO, J.F Using duality to solve discrete optimization problems: Theory and computational experience Math. Prog Study 3 (1975), 56-94.
|
| |
9
|
GEOFFRION, A.M. Lagrangian relaxation and its uses in integer programming. Math Prog. Study 2 (1974), 82-114.
|
| |
10
|
HELD, M, AND KARP, R.M The traveling-salesman problem and minimum spanning trees. Oper Res 18 (1970), 1138-1162
|
| |
11
|
HELD, M, WOLFE, P., AND CROWDER, H P Validation of subgradlent optimization. Math. Prog. 6 (1974), 62-88
|
| |
12
|
KLEINROCK, L Models for computer networks Proc of the Int. Conf. on Communication, Boulder, Colo., June 1969, pp 2.9-2 16.
|
| |
13
|
|
| |
14
|
MORGAN, H.L, AND LEVIN, K.D Optimal program and data locations in computer networks. Decision Sciences Working Paper 74-10-01, Univ. of Pennsylvania, Philadelphia, Pa, Sept. 1974.
|
| |
15
|
MORGAN, H.L., AND LEVIN, K.D. Private communication
|
| |
16
|
NEMHAUSER, G L, WOLSEY, L A., AND FISHER, M L An analysts of approximations for maximizing submodular set functions, 1 To appear in Math. Prog.
|
CITED BY 24
|
|
|
|
|
Anna Brunstrom , Scott T. Leutenegger , Rahul Simha, Experimental evaluation of dynamic data allocation strategies in a distributed database with changing workloads, Proceedings of the fourth international conference on Information and knowledge management, p.395-402, November 29-December 02, 1995, Baltimore, Maryland, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Yair Bartal , Moses Charikar , Piotr Indyk, On page migration and other relaxed task systems, Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms, p.43-52, January 05-07, 1997, New Orleans, Louisiana, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
H.2