Decomposing Linear Programs for Parallel Solution

@inproceedings{Pinar1995DecomposingLP,
  title={Decomposing Linear Programs for Parallel Solution},
  author={Ali Pinar and {\"U}mit V. Çataly{\"u}rek and Cevdet Aykanat and Mustafa Ç. Pinar},
  booktitle={PARA},
  year={1995}
}
Coarse grain parallelism inherent in the solution of Linear Programming LP problems with block angular constraint matrices has been exploited in recent research works However these approaches su er from unscalability and load imbalance since they exploit only the exist ing block angular structure of the LP constraint matrix In this paper we consider decomposing LP constraint matrices to obtain block angular structures with speci ed number of blocks for scalable parallelization We propose… CONTINUE READING
Highly Cited
This paper has 23 citations. REVIEW CITATIONS
15 Citations
9 References
Similar Papers

Citations

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

References

Publications referenced by this paper.
Showing 1-9 of 9 references

An e cient heuristic procedure for partitioning graphs

  • B. W. Kernighan, S. Lin
  • Technical Report
  • 1970
Highly Influential
9 Excerpts

Electronic mail distribution of linear programming test problems

  • D. M. Gay
  • Mathematical Programming Society COAL Newsletter,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…