{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T21:59:30Z","timestamp":1648504770139},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1007\/bf02241700","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T04:27:02Z","timestamp":1132028822000},"page":"241-262","source":"Crossref","is-referenced-by-count":1,"title":["An effective structured approach to finding optimal partitions of networks"],"prefix":"10.1007","volume":"29","author":[{"given":"H.","family":"Widjaja","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02241700_CR1","volume-title":"The design and analysis of computer algorithms","author":"Aho","year":"1974","unstructured":"Aho, Hopcroft, Ullman: The design and analysis of computer algorithms. Reading, Mass.: Addison-Wesley 1974."},{"key":"BF02241700_CR2","first-page":"23","volume":"40","author":"Baer","year":"1972","unstructured":"Baer, Caughey: Segmentation and optimization of programs from cyclic structure analysis. Proc. AFIPS40, 23\u201336 (1972).","journal-title":"Proc. AFIPS"},{"key":"BF02241700_CR3","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.13.4.517","volume":"13","author":"E. Balas","year":"1965","unstructured":"Balas, E.: An additive algorithm for solving linear programs with 0\u20131 variables. Opns. Res.13, 517\u2013549 (1965).","journal-title":"Opns. Res."},{"key":"BF02241700_CR4","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1287\/opre.15.5.915","volume":"15","author":"E. Balas","year":"1967","unstructured":"Balas, E.: Discrete programming by the filter method. Opns. Res.15, 915\u2013957 (1967).","journal-title":"Opns. Res."},{"key":"BF02241700_CR5","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1287\/opre.16.2.442","volume":"16","author":"E. Balas","year":"1968","unstructured":"Balas, E.: A note on the branch-and-bound principle. Opns. Res.16, 442\u2013445 (1968).","journal-title":"Opns. Res."},{"key":"BF02241700_CR6","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"Balas, E., Padberg, M. W.: Set partitioning: A survey. SIAM Review18, 710\u2013761 (1976).","journal-title":"SIAM Review"},{"key":"BF02241700_CR7","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge, C.: Graphs and hypergraphs. Amsterdam: North-Holland 1973."},{"key":"BF02241700_CR8","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1145\/321296.321300","volume":"12","author":"Colomb","year":"1965","unstructured":"Colomb, Baumert: Backtrack programming. JACM12, 516\u2013524 (1965).","journal-title":"JACM"},{"key":"BF02241700_CR9","doi-asserted-by":"crossref","unstructured":"Cook, S. A.: The complexity of theorem proving procedures. Proc. 3rd ACM Symp. Theory of computing, 151\u2013158 (1971).","DOI":"10.1145\/800157.805047"},{"key":"BF02241700_CR10","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1287\/mnsc.17.5.259","volume":"17","author":"Eilon","year":"1971","unstructured":"Eilon, Christofides: The loading problem. Manag. Sci.17, 259\u2013268 (1971).","journal-title":"Manag. Sci."},{"key":"BF02241700_CR11","doi-asserted-by":"crossref","first-page":"B495","DOI":"10.1287\/mnsc.16.8.B495","volume":"16","author":"Garfinkel","year":"1970","unstructured":"Garfinkel, Nemhauser: Optimal political districting by implicit enumeration techniques. Manag. Sci.16, B495-B508 (1970).","journal-title":"Manag. Sci."},{"key":"BF02241700_CR12","first-page":"76","volume":"1","author":"L. L. Gorinshteyn","year":"1969","unstructured":"Gorinshteyn, L. L.: The partitioning of graphs. Erg. Cybernetics1, 76\u201382 (1969).","journal-title":"Erg. Cybernetics"},{"key":"BF02241700_CR13","first-page":"269","volume":"15","author":"W. H\u00e4ndler","year":"1973","unstructured":"H\u00e4ndler, W.: A concept of macro-pipelining with high availability. Elektr. Rechenanlagen15, 269\u2013274 (1973).","journal-title":"Elektr. Rechenanlagen"},{"key":"BF02241700_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean methods in operations research and related areas","author":"Hammer","year":"1968","unstructured":"Hammer, Rudeanu: Boolean methods in operations research and related areas. Berlin-Heidelberg-New York: Springer 1968."},{"key":"BF02241700_CR15","unstructured":"Hammer, P. L.: Boolean elements in combinatorial optimization. In: Proc. Nato Adv. Study Institute, Versailles, 1974 (Roy, ed.), Combinatorial Programming: Methods and applications."},{"key":"BF02241700_CR16","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F. Harary","year":"1969","unstructured":"Harary, F.: Graph theory. Reading, Mass.: Addison-Wesley 1969."},{"key":"BF02241700_CR17","unstructured":"Hyafil, Rivest: Graph partitioning and constructing optimal decision trees are polynomial complete problems. IRIA Rapport de Recherche no. 33, October 1973."},{"key":"BF02241700_CR18","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF00998631","volume":"5","author":"T. Ibaraki","year":"1976","unstructured":"Ibaraki, T.: Theoretical comparisons of search strategies in branch-and-bound algorithms. Intern. J. Comp. and Inf. Sci.5, 315\u2013344 (1976).","journal-title":"Intern. J. Comp. and Inf. Sci."},{"key":"BF02241700_CR19","doi-asserted-by":"crossref","first-page":"1110","DOI":"10.1287\/opre.23.6.1110","volume":"23","author":"Ingargiola","year":"1975","unstructured":"Ingargiola, Korsh: An algorithm for the solution of the 0\u20131 loading problem. Opns Res.23, 1110\u20131119 (1975).","journal-title":"Opns Res."},{"key":"BF02241700_CR20","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1287\/opre.19.4.916","volume":"19","author":"P. A. Jensen","year":"1971","unstructured":"Jensen, P. A.: Optimal network partitioning. Opns. Res.19, 916\u2013932 (1971).","journal-title":"Opns. Res."},{"key":"BF02241700_CR21","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1287\/opre.17.6.1034","volume":"17","author":"R. E. Jensen","year":"1969","unstructured":"Jensen, R. E.: A dynamic programming algorithm for cluster analysis. Opns. Res.17, 1034\u20131057 (1969).","journal-title":"Opns. Res."},{"key":"BF02241700_CR22","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","volume":"8","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S.: Fast algorithms for bin-packing. J. Comp. Syst. Sci.8, 272\u2013314 (1974).","journal-title":"J. Comp. Syst. Sci."},{"key":"BF02241700_CR23","unstructured":"Johnson, J. W.: Program restructuring for virtual memory system. MIT MAC-TR-148, March 1975."},{"key":"BF02241700_CR24","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1145\/321623.321627","volume":"18","author":"B. W. Kernighan","year":"1971","unstructured":"Kernighan, B. W.: Optimal sequential partitions of graphs. JACM18, 34\u201340 (1971).","journal-title":"JACM"},{"key":"BF02241700_CR25","volume-title":"The art of computer programming, Vol. 1: Fundamental Algorithms","author":"D. E. Knuth","year":"1969","unstructured":"Knuth, D. E.: The art of computer programming, Vol. 1: Fundamental Algorithms. Reading, Mass.: Addison-Wesley 1969."},{"key":"BF02241700_CR26","unstructured":"Kohler, Steiglitz: Enumerative and iterative computational approaches. In: Computer and jobshop scheduling theory (Coffman, ed.), pp. 229\u2013287. J. Wiley 1976."},{"key":"BF02241700_CR27","first-page":"6","volume":"4","author":"J. Kral","year":"1968","unstructured":"Kral, J.: The formulation of the problem of program segmentation in the terms of pseudoboolean programming. Kybernetika4, 6\u201311 (1968).","journal-title":"Kybernetika"},{"key":"BF02241700_CR28","first-page":"86","volume":"11","author":"E. L. Lawler","year":"1962","unstructured":"Lawler, E. L.: Electric assemblies with a minimum number of interconnections. IRE Trans.EC-11, 86\u201388 (1962).","journal-title":"IRE Trans. EC"},{"key":"BF02241700_CR29","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"Lawler","year":"1966","unstructured":"Lawler, Wood: Branch-and-bound methods: A survey. Opns. Res.14, 699\u2013719 (1966).","journal-title":"Opns. Res."},{"key":"BF02241700_CR30","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Techn. J.44, 2245\u20132269 (1965).","journal-title":"Bell Syst. Techn. J."},{"key":"BF02241700_CR31","first-page":"184","volume":"16","author":"Luccio","year":"1969","unstructured":"Luccio, Sami: On the decomposition of networks in minimally interconnected subnetworks. IEEECT-16, 184\u2013188 (1969).","journal-title":"IEEE CT"},{"key":"BF02241700_CR32","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1147\/rd.192.0170","volume":"19","author":"J. A. Lukes","year":"1975","unstructured":"Lukes, J. A.: Combinatorial solution to the partitioning of general graphs. IBM J. Res. and Dev.19, 170\u2013180 (1975).","journal-title":"IBM J. Res. and Dev."},{"key":"BF02241700_CR33","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1287\/opre.18.1.24","volume":"18","author":"L. G. Mitten","year":"1970","unstructured":"Mitten, L. G.: Branch-and-bound methods: General formulation and properties. Opns. Res.18, 24\u201334 (1970).","journal-title":"Opns. Res."},{"key":"BF02241700_CR34","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/mnsc.15.3.191","volume":"15","author":"J. F. Pierce","year":"1968","unstructured":"Pierce, J. F.: Applications of combinatorial programming to a class of all zero-one integer programming problems. Manag. Sci.15, 191\u2013209 (1968).","journal-title":"Manag. Sci."},{"key":"BF02241700_CR35","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1287\/mnsc.19.5.528","volume":"19","author":"Pierce","year":"1973","unstructured":"Pierce, Lasky: Improved combinatorial programming algorithms for a class of all-zero-one integer programming problems. Manag. Sci.19, 528\u2013543 (1973).","journal-title":"Manag. Sci."},{"key":"BF02241700_CR36","doi-asserted-by":"crossref","first-page":"864","DOI":"10.1137\/0113056","volume":"13","author":"Reiter","year":"1965","unstructured":"Reiter, Sherman: Discrete optimization. Siam J. Applied Math.13, 864\u2013889 (1965).","journal-title":"Siam J. Applied Math."},{"key":"BF02241700_CR37","doi-asserted-by":"crossref","first-page":"1176","DOI":"10.1287\/opre.24.6.1176","volume":"24","author":"A. H. G. Rinnooy Kan","year":"1976","unstructured":"Rinnooy Kan, A. H. G.: On Mitten's axions for branch-and-bound. Opns. Res.24, 1176\u20131178 (1976).","journal-title":"Opns. Res."},{"key":"BF02241700_CR38","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1145\/321574.321584","volume":"17","author":"R. H. Roth","year":"1970","unstructured":"Roth, R. H.: An approach to solving linear discrete optimization problems. JACM17, 303\u2013313 (1970).","journal-title":"JACM"},{"key":"BF02241700_CR39","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"Sahni, S.: Computationally related problems. SIAM J. Computing3, 262\u2013279 (1974).","journal-title":"SIAM J. Computing"},{"key":"BF02241700_CR40","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"Sahni","year":"1976","unstructured":"Sahni, Gonzaley: P-complete approximation problems. JACM23, 555\u2013565 (1976).","journal-title":"JACM"},{"key":"BF02241700_CR41","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01580681","volume":"10","author":"S. L. Savage","year":"1976","unstructured":"Savage, S. L.: Some theoretical implications for local optimization. Math. Programming10, 345\u2013366 (1976).","journal-title":"Math. Programming"},{"key":"BF02241700_CR42","volume-title":"Das Erweiterungsprinzip","author":"M. Schoch","year":"1976","unstructured":"Schoch, M.: Das Erweiterungsprinzip. Berlin: VEB Deutscher Verlag der Wissenschaften 1976."},{"key":"BF02241700_CR43","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R. E. Tarjan","year":"1972","unstructured":"Tarjan, R. E.: Depth-first search and linear graph algorithms. SIAM J. Computing1, 146\u2013160 (1972).","journal-title":"SIAM J. Computing"},{"key":"BF02241700_CR44","unstructured":"Widjaja, H.: Messung des dynamischen Programmverhaltens im Adre\u00dfraum\u2014ein Beispiel f\u00fcr koordinierte Hardware\/Software-Messung. Arbeitsberichte des IMMD, Univ. Erlangen, Band 8, Nummer 9, Dezember 1975, pp. 114\u2013158, 161\u2013167."},{"key":"BF02241700_CR45","unstructured":"Widjaja, H.: Optimale Zerlegung von Graphen und die relevanten kombinatorischen Optimierungsaufgaben. Interne Arbeitsnotiz SS-77, IMMD, Univ. Erlangen, Juli 1977."},{"key":"BF02241700_CR46","unstructured":"Widjaja, H.: Die optimale Zerlegung von Netzen und die Optimierung des Proze\u00dfverhaltens im Adre\u00dfraum. Dissertation, Univ. Erlangen-N\u00fcrnberg. Arbeitsberichte des IMMD, Band 12, Nummer 8, Oktober 1979."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241700.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02241700\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02241700","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:15:45Z","timestamp":1557875745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02241700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["BF02241700"],"URL":"https:\/\/doi.org\/10.1007\/bf02241700","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}