A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems
dc.contributor.author | Michelena, Nestor F. | en_US |
dc.contributor.author | Papalambros, Panos Y. | en_US |
dc.date.accessioned | 2006-09-11T15:15:48Z | |
dc.date.available | 2006-09-11T15:15:48Z | |
dc.date.issued | 1997-09 | en_US |
dc.identifier.citation | Michelena, Nestor F.; Papalambros, Panos Y.; (1997). "A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems." Computational Optimization and Applications 8(2): 173-196. <http://hdl.handle.net/2027.42/44780> | en_US |
dc.identifier.issn | 0926-6003 | en_US |
dc.identifier.issn | 1573-2894 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/44780 | |
dc.description.abstract | Decomposition of large engineering system models is desirable sinceincreased model size reduces reliability and speed of numericalsolution algorithms. The article presents a methodology for optimalmodel-based decomposition (OMBD) of design problems, whether or notinitially cast as optimization problems. The overall model isrepresented by a hypergraph and is optimally partitioned into weaklyconnected subgraphs that satisfy decomposition constraints. Spectralgraph-partitioning methods together with iterative improvementtechniques are proposed for hypergraph partitioning. A known spectralK-partitioning formulation, which accounts for partition sizes andedge weights, is extended to graphs with also vertex weights. TheOMBD formulation is robust enough to account for computationaldemands and resources and strength of interdependencies between thecomputational modules contained in the model. | en_US |
dc.format.extent | 272221 bytes | |
dc.format.extent | 3115 bytes | |
dc.format.mimetype | application/pdf | |
dc.format.mimetype | text/plain | |
dc.language.iso | en_US | |
dc.publisher | Kluwer Academic Publishers; Springer Science+Business Media | en_US |
dc.subject.other | Mathematics | en_US |
dc.subject.other | Convex and Discrete Geometry | en_US |
dc.subject.other | Optimization | en_US |
dc.subject.other | Operations Research, Mathematical Programming | en_US |
dc.subject.other | Statistics, General | en_US |
dc.subject.other | Operation Research/Decision Theory | en_US |
dc.subject.other | Model Decomposition | en_US |
dc.subject.other | Multidisciplinary Design | en_US |
dc.subject.other | Hypergraph Partitioning | en_US |
dc.subject.other | Large-scale Design | en_US |
dc.subject.other | Decomposition | en_US |
dc.title | A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems | en_US |
dc.type | Article | en_US |
dc.subject.hlbsecondlevel | Mathematics | en_US |
dc.subject.hlbtoplevel | Science | en_US |
dc.description.peerreviewed | Peer Reviewed | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, 2250 G.G. Brown Bldg., Ann Arbor, MI, 48109-2125 | en_US |
dc.contributor.affiliationum | Department of Mechanical Engineering and Applied Mechanics, The University of Michigan, 2250 G.G. Brown Bldg., Ann Arbor, MI, 48109-2125 | en_US |
dc.contributor.affiliationumcampus | Ann Arbor | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/44780/1/10589_2004_Article_136837.pdf | en_US |
dc.identifier.doi | http://dx.doi.org/10.1023/A:1008673321406 | en_US |
dc.identifier.source | Computational Optimization and Applications | en_US |
dc.owningcollname | Interdisciplinary and Peer-Reviewed |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.