{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T06:31:31Z","timestamp":1775716291744,"version":"3.50.1"},"reference-count":67,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,9]]},"DOI":"10.1023\/a:1008673321406","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"173-196","source":"Crossref","is-referenced-by-count":66,"title":["A Hypergraph Framework for Optimal Model-Based Decomposition of Design Problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Nestor F.","family":"Michelena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos Y.","family":"Papalambros","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"136837_CR1","doi-asserted-by":"crossref","unstructured":"C.J. Alpert and A.B. Kahng, \"Geometric embeddings for faster and better multi-way netlist partitioning,\" in Proceedings 30th ACM\/IEEE Design Automation Conference, pp. 743\u2013748, 1993.","DOI":"10.1145\/157485.165115"},{"key":"136837_CR2","doi-asserted-by":"crossref","unstructured":"C.J. Alpert and S.-Z. Yao, \"Spectral partitioning: The more eigenvectors, the better,\" in Proceedings 32nd ACM\/IEEE Design Automation Conference, June 1995.","DOI":"10.1145\/217474.217529"},{"key":"136837_CR3","doi-asserted-by":"crossref","unstructured":"S.T. Barnard and H.D. Simon, \"A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems,\" in Proceedings 6th SIAM Conference on Parallel Processing for Scientific Computing, pp. 711\u2013718, 1993.","DOI":"10.1002\/cpe.4330060203"},{"key":"136837_CR4","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"E. Barnes","year":"1982","unstructured":"E. Barnes, \"An algorithm for partitioning the nodes of a graph,\" SIAM Journal on Algebrauc Discrete Methods, vol. 3, no. 4, pp. 541\u2013550, 1982.","journal-title":"SIAM Journal on Algebrauc Discrete Methods"},{"key":"136837_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0401030","volume":"1","author":"E. Barnes","year":"1988","unstructured":"E. Barnes, A. Vannelli, and J. Walker, \"A new heuristic for partitioning the nodes of a graph,\" SIAM Journal on Discrete Mathematics, vol. 1, no. 3, pp. 299\u2013305, 1988.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"136837_CR6","unstructured":"C.L. Bloebaum, \"Formal and heuristic system decomposition methods in multidisciplinary synthesis,\" NASA Contractor Report 4413, 1991."},{"key":"136837_CR7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0012-365X(93)90322-K","volume":"117","author":"M. Bolla","year":"1993","unstructured":"M. Bolla, \"Spectra, euclidean representations and clusterings of hypergraphs,\" Discrete Mathematics, vol. 117, pp. 19\u201339, 1993.","journal-title":"Discrete Mathematics"},{"key":"136837_CR8","doi-asserted-by":"crossref","unstructured":"R.B. Boppana, \"Eigenvalues and graph bisection: An average-case analysis,\" in Proceedings 28th IEEE Symposium on Foundations of Computer Science, pp. 280\u2013285, 1987.","DOI":"10.1109\/SFCS.1987.22"},{"key":"136837_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF02579448","volume":"7","author":"T.N. Bui","year":"1987","unstructured":"T.N. Bui, S. Chauduri, F.T. Leighton, and M. Sipser, \"Graph bisection algorithms with good average case behavior,\" Combinatorica, vol. 7, no. 2, pp. 171\u2013191, 1987.","journal-title":"Combinatorica"},{"key":"136837_CR10","doi-asserted-by":"crossref","unstructured":"T.N. Bui, C. Heigham, C. Jones, and T. Leighton, \"Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms,\" in Proceedings 26th ACM\/IEEE Design Automation Conference, pp. 775\u2013778, 1989.","DOI":"10.1145\/74382.74527"},{"key":"136837_CR11","doi-asserted-by":"crossref","unstructured":"T.N. Bui and B.R. Moon, \"A fast and stable hybrid genetic algorithm for the ratio-cut partitioning problem on hypergraphs,\" in Proceedings 31th ACM\/IEEE Design Automation Conference, pp. 664\u2013669, 1994.","DOI":"10.1145\/196244.196607"},{"key":"136837_CR12","doi-asserted-by":"crossref","first-page":"1088","DOI":"10.1109\/43.310898","volume":"13","author":"P.K. Chan","year":"1994","unstructured":"P.K. Chan, M.D.F. Schlag, and J.Y. Zien, \"Spectral K-way ratio-cut partitioning and clustering,\" IEEE Transactions on Computer-Auded Design of Integrated Circuits and Systems, vol. 13, no. 9, pp. 1088\u20131096, 1994.","journal-title":"IEEE Transactions on Computer-Auded Design of Integrated Circuits and Systems"},{"key":"136837_CR13","first-page":"811","volume":"29","author":"R.D. Consoli","year":"1992","unstructured":"R.D. Consoli and J. Sobieszczanski-Sobieski, \"Application of advanced multidisciplinary analysis and optimization methods to vehicle design synthesis,\" Journal of Aurcraft, vol. 29, no. 5, pp. 811\u2013818, 1992.","journal-title":"Journal of Aurcraft"},{"key":"136837_CR14","doi-asserted-by":"crossref","unstructured":"J.K. Cullum and R.A. Willoughby, Lanczos Algorithms for Large Symmetric Eigenvalue Computations, Birkh\u00a8auser: Boston, vol. 1, 1985.","DOI":"10.1007\/978-1-4684-9178-4_1"},{"key":"136837_CR15","volume-title":"Physical Design Automation of VLSI Systems","author":"W.E. Donath","year":"1988","unstructured":"W.E. Donath, \"Logic partitioning,\" Physical Design Automation of VLSI Systems, B.T. Preas and M.J. Lorenzetti (Eds.), Benjamin Cummings: Menlo Park, California, Chap. 3, 1988."},{"key":"136837_CR16","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"1","author":"W.E. Donath","year":"1973","unstructured":"W.E. Donath and A.J. Hoffman, \"Lower bounds for the partitioning of graphs,\" IBM Journal of Research and Development, vol. 1, pp. 420\u2013425, 1973.","journal-title":"IBM Journal of Research and Development"},{"key":"136837_CR17","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. Duff","year":"1989","unstructured":"I.S. Duff, A.M. Erisman, and J.K. Reid, Direct Methods for Sparse Matrices, Oxford Science Publications: Oxford, 1989."},{"key":"136837_CR18","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TCAD.1985.1270101","volume":"CAD-4","author":"A. Dunlop","year":"1985","unstructured":"A. Dunlop and B.W. Kernighan, \"A procedure for placement of standard-cell VLSI circuits,\" IEEE Transactions on Computer-Auded Design, vol. CAD-4, no. 1, pp. 92\u201398, 1985.","journal-title":"IEEE Transactions on Computer-Auded Design"},{"key":"136837_CR19","unstructured":"S.D. Eppinger, D.E. Whitney, and D.A. Gebala, \"Organizing the tasks in complex design projects: Development of tools to represent design procedures,\" in Proceedings NSF Design and Manufacturing System Conference, Atlanta, Georgia, Jan. 1992."},{"key":"136837_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01588087","volume":"6","author":"S.D. Eppinger","year":"1994","unstructured":"S.D. Eppinger, D.E. Whitney, R.P. Smith, and D.A. Gebala, \"A model-based method for organizing tasks in product development,\" Research in Engineering Design, vol. 6, pp. 1\u201313, 1994.","journal-title":"Research in Engineering Design"},{"key":"136837_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01581147","volume":"66","author":"J. Falkner","year":"1994","unstructured":"J. Falkner, F. Rendl, and H. Wolkowicz, \"A computational study of graph partitioning,\" Mathematical Programming, vol. 66, pp. 211\u2013239, 1994.","journal-title":"Mathematical Programming"},{"key":"136837_CR22","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1002\/nme.1620360503","volume":"36","author":"C. Farhat","year":"1993","unstructured":"C. Farhat and M. Lesoinne, \"Automatic partitioning of unstructured meshes for the parallel solution of problems in computational mechanics,\" International Journal for Numerical Methods in Engineering, vol. 36, pp. 745\u2013764, 1993.","journal-title":"International Journal for Numerical Methods in Engineering"},{"key":"136837_CR23","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1145\/361179.361195","volume":"17","author":"D. Ferrari","year":"1974","unstructured":"D. Ferrari, \"Improving locality by critical working sets,\" Communications of the ACM, vol. 17, no. 11, pp. 614\u2013620, 1974.","journal-title":"Communications of the ACM"},{"key":"136837_CR24","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia and R.M. Mattheyses, \"Alinear-time heuristic for improving network partitions,\" in Proceedings 19th ACM\/IEEE Design Automation Conference, pp. 175\u2013181, 1982.","DOI":"10.1109\/DAC.1982.1585498"},{"key":"136837_CR25","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","volume":"23","author":"M. Fiedler","year":"1973","unstructured":"M. Fiedler, \"Algebrauc connectivity of graphs,\" Czechoslovak Mathematics Journal, vol. 23, pp. 298\u2013305, 1973.","journal-title":"Czechoslovak Mathematics Journal"},{"key":"136837_CR26","first-page":"57","volume-title":"Combinatorics and Graph Theory","author":"M. Fiedler","year":"1989","unstructured":"M. Fiedler, \"Laplacian of graphs and algebrauc connectivity,\" Combinatorics and Graph Theory, Banach Center Publications: Warsaw, vol. 25, pp. 57\u201370, 1989."},{"key":"136837_CR27","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/moor.19.1.24","volume":"19","author":"O. Goldschmidt","year":"1994","unstructured":"O. Goldschmidt and D. Hochbaum, \"A polynomial algorithm for the k-Cut problem for fixed k,\" Mathematics of Operations Research, vol. 19, no. 1, pp. 24\u201337, 1994.","journal-title":"Mathematics of Operations Research"},{"key":"136837_CR28","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1109\/43.144852","volume":"11","author":"S. Hadley","year":"1992","unstructured":"S. Hadley, B. Mark, and A. Vannelli, \"An efficient Eigenvector approach for finding netlist partitions,\" IEEE Transactions on Computer-Auded Design, vol. 11, no. 7, pp. 885\u2013892, 1992.","journal-title":"IEEE Transactions on Computer-Auded Design"},{"key":"136837_CR29","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S. Hadley","year":"1992","unstructured":"S. Hadley, F. Rendl, and H. Wolkowicz, \"A new lower bound via projection for the quadratic assignment problem,\" Mathematics of Operations Research, vol. 17, no. 3, pp. 727\u2013739, 1992.","journal-title":"Mathematics of Operations Research"},{"key":"136837_CR30","volume-title":"Hierarchical Multiobjective Analysis of Large-Scale Systems","author":"Y. Haumes","year":"1990","unstructured":"Y. Haumes, K. Tarvaunen, T. Shima, and J. Thadathil, Hierarchical Multiobjective Analysis of Large-Scale Systems, HPC: New York, 1990."},{"key":"136837_CR31","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B. Hendrickson","year":"1995","unstructured":"B. Hendrickson and R. Leland, \"An improved spectral graph partitioning algorithm for mapping parallel computations,\" SIAM Journal on Scientific Computing, vol. 16, no. 2, pp. 452\u2013469, 1995.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"136837_CR32","volume-title":"The Chaco user's guide version 2.0","author":"B. Hendrickson","year":"1995","unstructured":"B. Hendrickson and R. Leland, \"The Chaco user's guide version 2.0,\" Technical Report SAND94-2692, Sandia National Labs, Albuquerque, New Mexico, 1995."},{"key":"136837_CR33","first-page":"Eds.","volume-title":"Lecture Notes in Economics and Mathematical Systems","author":"W. Hock","year":"1981","unstructured":"W. Hock and K. Schittkowski, \"Test examples for nonlinear programming codes,\" Lecture Notes in Economics and Mathematical Systems, no. 187, M. Beckman and H.P. K\u00fcnzi (Eds.), Springer-Verlag: Berlin, 1981."},{"key":"136837_CR34","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D.S. Johnson","year":"1989","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, \"Optimization by simulated annealing: An experimental evaluation; part I, graph partitioning,\" Operations Research, vol. 37, no. 6, pp. 865\u2013891, 1989.","journal-title":"Operations Research"},{"key":"136837_CR35","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan and S. Lin, \"An efficient heuristic procedure for partitioning graphs,\" The Bell System Technical Journal, vol. 49, pp. 291\u2013307, Feb. 1970.","journal-title":"The Bell System Technical Journal"},{"key":"136837_CR36","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TC.1984.1676460","volume":"C-33","author":"B. Krishnamurthy","year":"1984","unstructured":"B. Krishnamurthy, \"An improved min-cut algorithm for partitioning VLSI networks,\" IEEE Transactions on Computers, vol. C-33, no. 5, pp. 438\u2013446, 1984.","journal-title":"IEEE Transactions on Computers"},{"key":"136837_CR37","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1080\/00207549308956755","volume":"31","author":"A. Kusiak","year":"1993","unstructured":"A. Kusiak and J. Wang, \"Efficient organizing of design activities,\" International Journal of Production Research, vol. 31, no. 4, pp. 753\u2013769, 1993.","journal-title":"International Journal of Production Research"},{"key":"136837_CR38","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1115\/1.2919255","volume":"115","author":"A. Kusiak","year":"1993","unstructured":"A. Kusiak and J. Wang, \"Decomposition of the design process,\" trans. ASME, Journal of Mechanical Design, vol. 115, pp. 687\u2013695, Dec. 1993.","journal-title":"trans. ASME, Journal of Mechanical Design"},{"key":"136837_CR39","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer, Combinatorial Algorithms for Integrated Circuit Layout, John Wiley & Sons: Chichester, 1990."},{"key":"136837_CR40","first-page":"281","volume":"1","author":"J. MacQueen","year":"1967","unstructured":"J. MacQueen, \"Some methods for classification and analysis of multivariate observations,\" in Proceedings 5th Berkeley Symposium on Mathematical Statistics and Probability, vol. 1, pp. 281\u2013297, 1967.","journal-title":"Proceedings 5th Berkeley Symposium on Mathematical Statistics and Probability"},{"key":"136837_CR41","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1115\/1.2826697","volume":"117","author":"N. Michelena","year":"1995","unstructured":"N. Michelena and P. Papalambros, \"A network reliability approach to optimal decomposition of design problems,\" Trans. ASME, Journal of Mechanical Design, vol. 117, no. 3, pp. 433\u2013440, Sept. 1995.","journal-title":"Trans. ASME, Journal of Mechanical Design"},{"key":"136837_CR42","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1115\/1.2826710","volume":"117","author":"N. Michelena","year":"1995","unstructured":"N. Michelena and P. Papalambros, \"Optimal model-based partitioning of powertraun system design,\" Trans. ASME, Journal of Mechanical Design, vol. 117, no. 4, pp. 499\u2013505, Dec. 1995.","journal-title":"Trans. ASME, Journal of Mechanical Design"},{"key":"136837_CR43","first-page":"871","volume":"2","author":"B. Mohar","year":"1988","unstructured":"B. Mohar, \"The Laplacian spectrum of graphs,\" in Proceedings 6th International Conference on Theory and Applications of Graphs, Kalamazoo, Michigan, 1988, vol. 2, pp. 871\u2013898.","journal-title":"Proceedings 6th International Conference on Theory and Applications of Graphs, Kalamazoo, Michigan"},{"key":"136837_CR44","doi-asserted-by":"crossref","unstructured":"B. Mohar, \"Laplace eigenvalues of graphs-A survey,\" Discrete Mathematics, vol. 109, pp. 171\u2013183, 1992.","DOI":"10.1016\/0012-365X(92)90288-Q"},{"key":"136837_CR45","volume-title":"The Symmetric Eigenvalue Problem","author":"B.N. Parlett","year":"1980","unstructured":"B.N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Inc.: Englewood Cliffs, 1980."},{"key":"136837_CR46","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. Simon, and K. Liou, \"Partitioning sparse matrices with eigenvectors of graphs,\" SIAM Journal on Matrix Analysis and Applications, vol. 11, no. 3, pp. 430\u2013452, 1990.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"136837_CR47","first-page":"90","volume-title":"Research Report CORR","author":"F. Rendl","year":"1990","unstructured":"F. Rendl and H. Wolkowicz, \"A projection technique for partitioning the nodes of a graph,\" Research Report CORR 90\u201320, University of Waterloo, Canada, 1990."},{"key":"136837_CR48","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01585694","volume":"53","author":"F. Rendl","year":"1992","unstructured":"F. Rendl and H. Wolkowicz, \"Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem,\" Mathematical Programming, vol. 53, pp. 63\u201378, 1992.","journal-title":"Mathematical Programming"},{"key":"136837_CR49","doi-asserted-by":"crossref","unstructured":"B. Riess, K. Doll, and F. Johannes, \"Partitioning very large circuits using analytical placement techniques,\" in Proceedings 31st ACM\/IEEE Design Automation Conference, pp. 646\u2013651, 1994.","DOI":"10.1145\/196244.196602"},{"key":"136837_CR50","doi-asserted-by":"crossref","unstructured":"J.L. Rogers and C.L. Bloebaum, \"Ordering design tasks based on coupling strengths,\" Proceedings 5th AUAA\/NASA\/USAF\/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Panama City, 1994, AUAA paper 94-4326-CP, pp. 708\u2013717.","DOI":"10.2514\/6.1994-4326"},{"key":"136837_CR51","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/12.8730","volume":"38","author":"L.A. Sanchis","year":"1989","unstructured":"L.A. Sanchis, \"Multiple-way network partitioning,\" IEEE Transactions on Computers, vol. 38, no. 1, pp. 62\u201381, 1989.","journal-title":"IEEE Transactions on Computers"},{"key":"136837_CR52","doi-asserted-by":"crossref","first-page":"1500","DOI":"10.1109\/12.260640","volume":"42","author":"L.A. Sanchis","year":"1993","unstructured":"L.A. Sanchis, \"Multiple-way network partitioning with different cost functions,\" IEEE Transactions on Computers, vol. 42, no. 12, pp. 1500\u20131504, 1993.","journal-title":"IEEE Transactions on Computers"},{"key":"136837_CR53","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0956-0521(91)90014-V","volume":"2","author":"H. Simon","year":"1991","unstructured":"H. Simon, \"Partitioning of unstructured problems for parallel processing,\" Computing Systems in Engineering, vol. 2, no. 2\/3, pp. 135\u2013148, 1991.","journal-title":"Computing Systems in Engineering"},{"key":"136837_CR54","volume-title":"Optimization by decomposition: Step from hierarchic to non-hierarchic systems","author":"J. Sobieszczanski-Sobieski","year":"1988","unstructured":"J. Sobieszczanski-Sobieski, \"Optimization by decomposition: Step from hierarchic to non-hierarchic systems,\" NASA TM 101494, Langley Research Center, Hampton, Virginia, 1988."},{"key":"136837_CR55","first-page":"153","volume":"28","author":"J. Sobieszczanski-Sobieski","year":"1990","unstructured":"J. Sobieszczanski-Sobieski, \"Sensitivity of complex, internally coupled systems,\" AUAA Journal, vol. 28, pp. 153\u2013160, Jan. 1990.","journal-title":"AUAA Journal"},{"key":"136837_CR56","doi-asserted-by":"crossref","unstructured":"J. Sobieszczanski-Sobieski, \"Optimization by decomposition,\" Structural Optimization: Status and Promise, M.P. Kamat (Ed.), Progress in Astronautics and Aeronautics Series, vol. 150, pp. 487\u2013515, 1993.","DOI":"10.2514\/5.9781600866234.0487.0515"},{"key":"136837_CR57","volume-title":"Systems Analysis and Management: Structure, Strategy, and Design","author":"D.V. Steward","year":"1981","unstructured":"D.V. Steward, Systems Analysis and Management: Structure, Strategy, and Design, Petrocelli Books, Inc.: New York, 1981."},{"key":"136837_CR58","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1109\/TEM.1981.6448589","volume":"EM-28","author":"D.V. Steward","year":"1981","unstructured":"D.V. Steward, \"The design structure system: A method for managing the design of complex systems,\" IEEE Transactions on Engineering Management, vol. EM-28, no. 3, pp. 71\u201374, 1981.","journal-title":"IEEE Transactions on Engineering Management"},{"key":"136837_CR59","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/31.1742","volume":"35","author":"P. Suaris","year":"1988","unstructured":"P. Suaris and G. Kedem, \"An algorithm for quadrisection and its application to standard cell placement,\" IEEE Transactions on Circuits and Systems, vol. 35, no. 3, pp. 294\u2013303, 1988.","journal-title":"IEEE Transactions on Circuits and Systems"},{"key":"136837_CR60","doi-asserted-by":"crossref","unstructured":"T. Tokuyama and J. Nakano, \"Geometric algorithms for a minimum cost assignment problem,\" in Proceedings 7th ACM Symposium on Computational Geometry, pp. 262\u2013271, 1991.","DOI":"10.1145\/109648.109678"},{"key":"136837_CR61","unstructured":"N. Tzannetakis, M. Jensen, and J. Novak, \"Development of optimal design methodologies for engine aur management,\" presented at the 15th International Symposium on Mathematical Programming, Ann Arbor, Michigan, 1994."},{"key":"136837_CR62","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0272-6963(86)90002-1","volume":"6","author":"A.J. Vakharia","year":"1986","unstructured":"A.J. Vakharia, \"Methods of cell formation in group technology: A framework for evaluation,\" International Journal of Operations Management, vol. 6, no. 3, pp. 257\u2013271, 1986.","journal-title":"International Journal of Operations Management"},{"key":"136837_CR63","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/00207548608919736","volume":"24","author":"A. Vannelli","year":"1986","unstructured":"A. Vannelli and K. Kumar, \"A method for finding minimal bottleneck cells for grouping part-machine families,\" International Journal of Production Research, vol. 24, pp. 387\u2013400, 1986.","journal-title":"International Journal of Production Research"},{"key":"136837_CR64","volume-title":"A General Decomposition Methodology for Optimal System Design","author":"T.C. Wagner","year":"1993","unstructured":"T.C. Wagner, A General Decomposition Methodology for Optimal System Design, Ph.D. dissertation, Department of Mechanical Engineering and Applied Mechanics, University of Michigan, Ann Arbor, Michigan, 1993."},{"key":"136837_CR65","first-page":"315","volume-title":"Advances in Design Automation-1993","author":"T.C. Wagner","year":"1993","unstructured":"T.C. Wagner and P.Y. Papalambros, \"A general framework for decomposition analysis in optimal design,\" Advances in Design Automation-1993, B.J. Gilmore (Ed.), ASME: New York, vol. 2, pp. 315\u2013325, 1993."},{"key":"136837_CR66","first-page":"327","volume-title":"Advances in Design Automation-1993","author":"T.C. Wagner","year":"1993","unstructured":"T.C. Wagner and P.Y. Papalambros, \"Implementation of decomposition analysis in optimal design,\" Advances in Design Automation-1993, B.J. Gilmore (Ed.), ASME: New York, vol. 2, pp. 327\u2013335, 1993."},{"key":"136837_CR67","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1109\/43.87601","volume":"10","author":"Y.C. Wei","year":"1991","unstructured":"Y.C. Wei and C.K. Cheng, \"Ratio cut partitioning for hierarchical designs,\" IEEE Transactions on Computer-Auded Design, vol. 10, no. 7, pp. 911\u2013921, 1991.","journal-title":"IEEE Transactions on Computer-Auded Design"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008673321406.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008673321406\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008673321406.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:20:50Z","timestamp":1752376850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008673321406"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":67,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["136837"],"URL":"https:\/\/doi.org\/10.1023\/a:1008673321406","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}