Partitioning mathematical programs for parallel solution
نویسندگان
چکیده
منابع مشابه
Partitioning mathematical programs for parallel solution
This paper describes heuristics for partitioning a general M x N matrix 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...
متن کاملDecomposing Linear Programs for Parallel Solution
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 ...
متن کاملA Parallel Macro Partitioning Framework for Solving Mixed Integer Programs
Mixed Integer Programs are a class of optimization problems which have a vast range of applications in engineering, business, science, health care, and other areas. For many applications, however, problems of realistic size can take a an impractical amount of time to solve on a single workstation. However, using parallel computing resources to solve MIP is difficult, as parallelizing the standa...
متن کاملAn Effective Model to Decompose Linear Programs for Parallel Solution
Although inherent parallelism in the solution of block angular Linear Programming (LP) problems has been exploited in many research works, the literature that addresses decomposing constraint matrices into block angular form for parallel solution is very rare and recent. We have previously proposed hypergraph models, which reduced the problem to the hypergraph partitioning problem. However, the...
متن کاملParallel algorithms for hypergraph partitioning
Near-optimal decomposition is central to the efficient solution of numerous problems in scientific computing and computer-aided design. In particular, intelligent a priori partitioning of input data can greatly improve the runtime and scalability of large-scale parallel computations. Discrete data structures such as graphs and hypergraphs are used to formalise such partitioning problems, with h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 1998
ISSN: 0025-5610,1436-4646
DOI: 10.1007/bf01582130