Now showing items 3-9 of 9

    • Minimum-Perimeter Domain Assignment 

      Christou, Ioannis; Meyer, Robert R.; Yackel, Jonathan (1997)
      For certain classes of problems defined over two-dimensional domains with grid structure, optimization problems involving the assignment of grid cells to processors present a nonlinear network model for the problem of ...
    • Optimal and Asymptotically Optimal Equi-partition of Rectangular Domains via Stripe Decomposition 

      Meyer, Robert R.; Christou, Ioannis T. (1995)
      We present an efficient method for assigning any number of processors to tasks associated with the cells of a rectangular uniform grid. Load balancing equi-partition constraints are observed while approximately minimizing ...
    • Optimal Equi-Partition of Rectangular Domains for Parallel Computation 

      Meyer, Robert R.; Christou, Ioannis T. (1995-02-28)
      We present an efficient method for the partitioning of rectangular domains into equi-area sub domains of minimum total perimeter. For a variety of applications in parallel computation, this corresponds to a load-balanced ...
    • A Theoretical and Computational Comparison of "Equivalent" Mixed-Integer Formulations 

      Meyer, Robert R. (University of Wisconsin-Madison Department of Computer Sciences, 1978)
      This paper provides a theoretical and computational comparison of alternative mixed integer programming formulations for optimization problems involving certain types of economy-of-scale functions. Such functions arise ...
    • Two-Segment Separable Programming 

      Meyer, Robert R. (University of Wisconsin-Madison Department of Computer Sciences, 1978)
      New iterative separable programming techniques based on two-segment, piecewise-linear approximations are described for the minimization of convex separable functions over convex sets. These techniques have two advantages ...
    • The Validity of a Family of Optimization Methods 

      Meyer, Robert R. (University of Wisconsin-Madison Department of Computer Sciences, 1968)
      A family of iterative optimization methods, which includes most of the well-known algorithms of mathematical programming, is described and analyzed with respect to the properties of its accumulation points. It is shown ...
    • A variable-penalty alternating directions method for convex optimization 

      Kontogiorgis, Spyridon; Meyer, Robert R. (1995)
      We study a generalized version of the method of alternating directions as applied to the minimization of the sum of two convex functions subject to linear constraints. The method consists of solving consecutively in each ...