Minimum-perimeter domain assignment

Mathematical Programming, Series B

Volumn 78, Issue 2, 1997, Pages 283-303

  Yackel, Jonathan ^a   Meyer, Robert R ^b   Christou, Ioannis ^b  

^a UNIVERSITY OF WISCONSIN OSHKOSH   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PROGRAM PROCESSORS;

MINIMUM-PERIMETER DOMAIN ASSIGNMENT;

NONLINEAR PROGRAMMING;

EID: 0031213443     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02614375     Document Type: Article

References (18)

1. R.J. Chen, R.R. Meyer and J. Yackel, A genetic algorithm for diversity minimization and its parallel implementation, in: Proceedings of the 5th International Conference on Genetic Algorithms (Morgan Kaufmann, Los Altos, CA, 1993) 163-170.
2. I.T. Christou and R.R. Meyer, Optimal equi-partition of rectangular domains for parallel computation, Journal of Global Optimization 8 (1996) 15-34.
3. R. DeLeone and M.A. Tork-Roth, Massively parallel solution of quadratic programs via successive overrelaxation, Computer Sciences Technical Report 1041, University of Wisconsin - Madison, Madison, WI, 1991.
4. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979) 60-62.
5. S. Ghandeharizadeh, G.L. Schultz, R.R. Meyer and J. Yackel, Optimal processor assignment for parallel database design, in: Proceedings of the 5th SIAM Conference on Parallel Processing for Scientific Computing, 1992.
6. S. Ghandeharizadeh, G.L. Schultz, R.R. Meyer and J. Yackel, Optimal balanced assignments and a parallel database application, ORSA Journal on Computing 5 (1993) 151-167.
7. J.R. Gilbert, G.L. Miller and S.H. Teng, Geometric mesh partitioning: Implementation and experiments, in: Proceedings of the 9th International Symposium on Parallel Processing (1995) 418-427.
8. W.D. Gropp and D.E. Keyes, Domain decomposition methods in computational fluid dynamics, Technical Report 91-20, ICASE, 1991.
9. B.W. Kernighan and S. Lin, An effective heuristic procedure for partitioning graphs, Bell Systems Technical Journal (February 1970) 291-308.
10. Y. Li, P.M. Pardalos and M.G.C. Resende, A grasp for the qap, in: P. M. Pardalos and H. Wolkowicz, eds., Quadratic Assignment and Related Problems, DIMACS Series, Vol. 16 (American Mathematical Society, Providence, RI, 19940.
11. K.Y. Lin, Exact solution of the convex polygon perimeter and area generating function, Journal of Physics. A. Mathematical and General 24 (1991) 2411-2417.
12. M. Bousquet Melou, Codage des polyominos convexes et equation pour l'enumeration suivant l'aire, Discrete Applied Mathematics 48 (1994) 21-43.
13. G.L. Miller, S.H. Teng, W. Thurston and S.A. Vavasis, Automatic mesh partitioning, in: A. George, J.R. Gilbert and J.W.H. Liu, eds., Graph Theory and Sparse Matrix Computation (Springer, Berlin, 1993).
14. A. Pothen, H.D. Simon and K.P. Liu, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications 11 (1990) 430-452.
15. A.L. Rosenberg, Encoding data structures in trees, J. ACM 26 (4) (1979) 668-689.
16. R.J. Schalkoff, Digital Image Processing and Computer Vision (John Wiley & Sons, New York, 1989).
17. J. Yackel, Minimum-perimeter tiling for optimization of parallel computation, Ph.D. Thesis, University of Wisconsin - Madison, 1993, Computer Sciences Technical Report #1170.
18. J. Yackel and R.R. Meyer, Optimal tilings for parallel database design, in: P.M. Pardalos, ed., Advances in Optimization and Parallel Computing (North-Holland, Amsterdam, 1992) 293-309.