Partitioning mathematical programs for parallel solution

  title={Partitioning mathematical programs for parallel solution},
  author={Michael C. Ferris and Jeffrey D. Horn},
  journal={Math. Program.},
into arrowhead form. Such heuristics are useful for decomposing large, constrained, optimization problems into forms that are amenable to parallel processing. The heuristics presented can be easily implemented using publicly available graph partitioning algorithms. The application of such techniques for solving large linear programs is described. Extensive computational results on the eeectiveness of our partitioning procedures and their usefulness for parallel optimization are presented. 


Publications citing this paper.
Showing 1-10 of 34 extracted citations


Publications referenced by this paper.
Showing 1-10 of 30 references


  • G. A. Geist, A. L. Beguelin, J. J. Dongarra, W. Jiang
  • Manchek and V. S. Sunderam, PVM: Parallel…
  • 1994
Highly Influential
5 Excerpts

Bundle-based decomposition: Conditions for convergence

  • S. M. Robinson
  • in: H. Attouch, J. P. Aubin, F. Clarke and I…
  • 1989
Highly Influential
6 Excerpts

Bundle-based decomposition: Description and preliminary results

  • S. M. Robinson
  • in: A. Pr ekopa, J. Szelezc an and B. Straazicky…
  • 1986
Highly Influential
6 Excerpts

On the regularized decomposition for stochastic programming problems

  • A. Ruszczynski
  • in: K. Marti and P. Kall eds., Stochastic…
  • 1995
1 Excerpt

The Chaco user's guide: Version 2

  • B. Hendrickson, R. Leland
  • Technical Report SAND94-2692, Sandia National…
  • 1994
3 Excerpts

Similar Papers

Loading similar papers…