Nestor Michelena, Panos Papalambros  Home/Search
Context Related
| umich.edu/papers/COAP55295.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: umich.edu/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Decomposition of large engineering system models is desirable since increased model size reduces reliability and speed of numerical solution algorithms. The article presents a methodology for optimal model-based decomposition (OMBD) of design problems, whether or not initially cast as optimization problems. The overall model is represented by a hypergraph and is optimally partitioned into weakly connected subgraphs that satisfy decomposition constraints. Spectral graph-partitioning methods... (Update)
Context of citations to this paper: More
...strategies based on known two level mathematical programming approaches. Wagner and Papalambros (1993a, 1993b) and Michelena and Papalambros (1994, 1995) specify decomposition strategies for a two level mathematical programming approach to design large systems. These...
Cited by: More
Composing Software from Multiple Concerns: - Composability And Composition (Correct)
Functional Graphical Models - Marchadier (2003) (Correct)
Hierarchical Concurrent Engineering: Supporting.. - D'Ambrosio, Birmingham (1995) (Correct)
Similar documents (at the sentence level): More
73.5%: A Hypergraph Framework For Optimal Model-Based.. - Michelena, Papalambros (1995) (Correct)
17.9%: Optimal Model-Based Decomposition Of Powertrain System Design - Michelena, Papalambros (1995) (Correct)
14.7%: Optimal Model-Based Decomposition of Powertrain System Design - Michelena, Papalambros (1995) (Correct)
Active bibliography (related documents): More All
1.2: A Network Reliability Approach To Optimal Decomposition.. - Michelena, Papalambros (1994) (Correct)
0.5: A Comprehensive Review of Production-Oriented.. - Joines, King, Culbreth (1996) (Correct)
0.5: Convergence Criteria for Hierarchical Overlapping.. - Park, Michelena.. (1998) (Correct)
Similar documents based on text: More All
0.4: A CORBA-Based Object-Oriented Framework For.. - Michelena.. (Correct)
0.3: Hierarchical Overlapping Coordination Under.. - Michelena, Park.. (1998) (Correct)
0.3: Derivative-Free and Global Search Optimization Algorithms in an.. - Fellini (1998) (Correct)
BibTeX entry: (Update)
Michelena, N., and Papalammbros, P.Y. (1995). A hypergraph framework for optimal model-based decomposition of design problems, Univ. of Michigan Technical Report UM-MEAM 95-02. http://citeseer.ist.psu.edu/michelena97hypergraph.html More
@misc{ michelena95hypergraph,
author = "N. Michelena and P. Papalammbros",
title = "A hypergraph framework for optimal model-based decomposition of design
problems",
text = "Michelena, N., and Papalammbros, P.Y. (1995). A hypergraph framework for
optimal model-based decomposition of design problems, Univ. of Michigan
Technical Report UM-MEAM 95-02.",
year = "1995",
url = "citeseer.ist.psu.edu/michelena97hypergraph.html" }
Citations (may not include all citations):441 The Symmetric Eigenvalue Problem (context) - Parlett - 1980
429 An Efficient Heuristic Procedure for Partitioning Graphs (context) - Kernighan, Lin - 1970
421 A Linear-Time Heuristic for Improving Network Partitions (context) - Fiduccia, Mattheyses - 1982
371 Optimization by Simulated Annealing: An Experimental Evaluat.. (context) - Johnson, Aragon et al. - 1989
322 Direct Methods for Sparse Matrices (context) - Duff, Erisman et al. - 1989
309 Partitioning Sparse Matrices with Eigenvectors of Graphs (context) - Pothen, Simon et al. - 1990
283 Some Methods for Classification and Analysis of Multivariate.. - MacQueen - 1967
264 Combinatorial Algorithms for Integrated Circuit Layout (context) - Lengauer - 1990
222 A Fast Multilevel Implementation of Recursive Spectral Bisec.. - Barnard, Simon - 1993
219 Partitioning of Unstructured Problems for Parallel Processin.. - Simon - 1991
127 Lanczos Algorithms for Large Symmetric Eigenvalue Computatio.. (context) - Cullum, Willoughby - 1985
115 An Improved Spectral Graph Partitioning Algorithm for Mappin.. - Hendrickson, Leland - 1995
108 Algebraic Connectivity of Graphs (context) - Fiedler - 1973
101 Test Examples for Nonlinear Programming Codes (context) - Hock, Schittkowski - 1981
88 A Procedure for Placement of Standard-Cell VLSI Circuits (context) - Dunlop, Kernighan - 1985
88 Eigenvalues and Graph Bisection: An Average-Case Analysis (context) - Boppana - 1987
82 Lower Bounds for the Partitioning of Graphs (context) - Donath, Hoffman - 1973
78 An Improved Min-Cut Algorithm for Partitioning VLSI Networks (context) - Krishnamurthy - 1984
77 Multiple-Way Network Partitioning (context) - Sanchis - 1989
72 Graph Bisection Algorithms with Good Average Case Behavior (context) - Bui, Chauduri et al. - 1987
70 The Laplacian Spectrum of Graphs (context) - Mohar - 1988
63 Automatic Partitioning of Unstructured Meshes for the Parall.. (context) - Farhat, Lesoinne - 1993
61 Ratio Cut Partitioning for Hierarchical Designs (context) - Wei, Cheng - 1991
57 An Algorithm for Partitioning the Nodes of a Graph (context) - Barnes - 1982
43 Improving the Performance of the Kernighan-Lin and Simulated.. (context) - Bui, Heigham et al. - 1989
41 A Projection Technique for Partitioning the Nodes of a Graph - Rendl, Wolkowicz - 1990
38 A New Lower Bound Via Projection for the Quadratic Assignmen.. - Hadley, Rendl et al. - 1992
37 Partitioning Very Large Circuits Using Analytical Placement .. (context) - Riess, Doll et al. - 1994
35 Applications of Parametric Programming and Eigenvalue Maximi.. (context) - Rendl, Wolkowicz - 1992
30 Spectral K-Way Ratio-Cut Partitioning and Clustering (context) - Chan, Schlag et al. - 1994
27 Geometric Embeddings for Faster and Better Multi-Way Netlist.. - Alpert, Kahng - 1993
26 A Computational Study of Graph Partitioning - Falkner, Rendl et al. - 1994
25 Logic Partitioning (context) - Donath - 1988
22 Spectral Partitioning: The More Eigenvectors, The Better - Alpert, Yao - 1995
19 A Model-Based Method for Organizing Tasks in Product Develop.. (context) - Eppinger, Whitney et al. - 1994
19 Optimization by Decomposition: Step from Hierarchic to NonHi.. (context) - Sobieszczanski-Sobieski - 1988
19 An Algorithm for Quadrisection and Its Application to Standa.. (context) - Suaris, Kedem - 1988
18 The Design Structure System: A Method for Managing the Desig.. (context) - Steward - 1981
16 Sensitivity of Complex, Internally Coupled Systems (context) - Sobieszczanski-Sobieski - 1990
15 Improving Locality by Critical Working Sets (context) - Ferrari - 1974
14 An Efficient Eigenvector Approach for Finding Netlist Partit.. (context) - Hadley, Mark et al. - 1992
13 Multiple-Way Network Partitioning with Different Cost Functi.. (context) - Sanchis - 1993
13 A Fast and Stable Hybrid Genetic Algorithm for the Ratio-Cut.. (context) - Bui, Moon - 1994
12 Geometric Algorithms for a Minimum Cost Assignment Problem (context) - Tokuyama, Nakano - 1991
12 A General Framework for Decomposition Analysis in Optimal De.. (context) - Wagner, Papalambros - 1993
12 A New Heuristic for Partitioning the Nodes of a Graph (context) - Barnes, Vannelli et al. - 1988
11 A Network Reliability Approach to Optimal Decomposition of D.. - Michelena, Papalambros - 1995
11 The Chaco User's Guide Version 2.0 (context) - Hendrickson, Leland - 1995
10 A General Decomposition Methodology for Optimal System Desig.. (context) - Wagner - 1993
10 Hierarchical Multiobjective Analysis of Large-Scale Systems (context) - Haimes, Tarvainen et al. - 1990
9 Laplace Eigenvalues of Graphs---A Survey (context) - Mohar - 1992
8 Ordering Design Tasks Based on Coupling Strengths - Rogers, Bloebaum - 1994
7 A Polynomial Algorithm for the k-Cut Problem for Fixed k (context) - Goldschmidt, Hochbaum - 1994
6 Systems Analysis and Management: Structure (context) - Steward - 1981
6 Implementation of Decomposition Analysis in Optimal Design (context) - Wagner, Papalambros - 1993
6 Laplacian of Graphs and Algebraic Connectivity (context) - Fiedler - 1989
6 Efficient Organizing of Design Activities (context) - Kusiak, Wang - 1993
5 Organizing the Tasks in Complex Design Projects: Development.. (context) - Eppinger, Whitney et al. - 1992
5 Decomposition of the Design Process (context) - Kusiak, Wang - 1993
4 Optimal Model-Based Partitioning of Powertrain System Design (context) - Michelena, Papalambros - 1995
4 Methods of Cell Formation in Group Technology: A Framework f.. (context) - Vakharia - 1986
4 Formal and Heuristic System Decomposition Methods in Multidi.. (context) - Bloebaum - 1991
3 Application of Advanced Multidisciplinary Analysis and Optim.. (context) - Consoli, Sobieszczanski-Sobieski - 1992
3 Spectra, Euclidean Representations and Clusterings of Hyperg.. (context) - Bolla - 1993
3 A Method for Finding Minimal Bottleneck Cells for Grouping P.. (context) - Vannelli, Kumar - 1986
3 Optimization by Decomposition (context) - Sobieszczanski-Sobieski - 1993
3 Development of Optimal Design Methodologies for Engine Air M.. (context) - Tzannetakis, Jensen et al. - 1994
Documents on the same site (http://ode.engin.umich.edu/publications.html): More
Designing Broadband Patch Antennas Using the Sequential.. - Li, Papalambros, Volakis (1997) (Correct)
Trends And Challenges In System Design Optimization - Papalambros, al. (2000) (Correct)
Performance Enhancement of Bandgap Printed Antennas.. - Li, Volakis, Papalambros (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC