{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/19695"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/19695","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits","abstract":"In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network Bisection, Vertex Cover, Set Partition, Hamilton Circuit, Traveling Salesman, Linear Ordering, Standard Cell Placement, and Multi-way Circuit Partitioning problems. It is empirically shown that SE out-performs the more established general optimization algorithm, namely, Simulated Annealing.","abstract_html":"In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network Bisection, Vertex Cover, Set Partition, Hamilton Circuit, Traveling Salesman, Linear Ordering, Standard Cell Placement, and Multi-way Circuit Partitioning problems. It is empirically shown that SE out-performs the more established general optimization algorithm, namely, Simulated Annealing.","abstract_has_math":false,"creators":["Saab, Youssef Georges"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Electrical and Computer Engineering","degree_department":null,"school":null,"contributors":["Rao, Vasant B."],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-05-07T12:15:35Z","date_published":"2011-05-07T12:15:35Z","updated_at":"2026-07-22T22:25:14Z","subjects":["Engineering, Electronics and Electrical","Computer Science"],"languages":["eng"],"rights":["Copyright 1990 Saab, Youssef Georges"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9114396","(UMI)AAI9114396"],"render_values":[{"text":"AAI9114396","href":null,"code":true},{"text":"(UMI)AAI9114396","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/19695","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Rao, Vasant B."]},{"key":"dc:creator","label":"Author","values":["Saab, Youssef Georges"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2011-05-07T12:15:35Z","10000-01-01","1990"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Electrical and Computer Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Engineering, Electronics and Electrical","Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["Copyright 1990 Saab, Youssef Georges"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["AAI9114396","(UMI)AAI9114396","http://hdl.handle.net/2142/19695"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network Bisection, Vertex Cover, Set Partition, Hamilton Circuit, Traveling Salesman, Linear Ordering, Standard Cell Placement, and Multi-way Circuit Partitioning problems. It is empirically shown that SE out-performs the more established general optimization algorithm, namely, Simulated Annealing.","Made available in DSpace on 2011-05-07T12:15:35Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9114396.pdf: 3854467 bytes, checksum: 6db5947c8446ada4827f2b78240de1d4 (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:38:48Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:16:14-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"]},{"key":"dc:title","label":"Title","values":["Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits"]}]}],"canonical_facts":{"dc:contributor":["Rao, Vasant B."],"dc:creator":["Saab, Youssef Georges"],"dc:date":["2011-05-07T12:15:35Z","10000-01-01","1990"],"dc:description":["In this thesis, a new general adaptive algorithm for solving a wide variety of NP-Complete combinatorial problems is developed. The new technique is called Stochastic Evolution (SE). The SE algorithm is applied to Network Bisection, Vertex Cover, Set Partition, Hamilton Circuit, Traveling Salesman, Linear Ordering, Standard Cell Placement, and Multi-way Circuit Partitioning problems. It is empirically shown that SE out-performs the more established general optimization algorithm, namely, Simulated Annealing.","Made available in DSpace on 2011-05-07T12:15:35Z (GMT). No. of bitstreams: 2 license.txt: 4922 bytes, checksum: 910b249b4beec47e7ab768910c8f966f (MD5) 9114396.pdf: 3854467 bytes, checksum: 6db5947c8446ada4827f2b78240de1d4 (MD5) Previous issue date: 1990","Item marked as restricted to the 'UIUC Users [automated]' Group (id=2) by Howard Ding (hding2@illinois.edu) on 2011-05-07T14:38:48Z Item is restricted indefinitely.","Restriction data tranferred 2014-07-01T11:16:14-05:00 Original Data Group with Access UIUC Users [automated] Release Date: none Reason: ETDs are only available to UIUC Users without author permission","ETDs are only available to UIUC Users without author permission","U of I Only"],"dc:identifier":["AAI9114396","(UMI)AAI9114396","http://hdl.handle.net/2142/19695"],"dc:language":["eng"],"dc:rights":["Copyright 1990 Saab, Youssef Georges"],"dc:subject":["Engineering, Electronics and Electrical","Computer Science"],"dc:title":["Combinatorial optimization by stochastic evolution with applications to the physical design of VLSI circuits"],"dc:type":["text"],"thesis:degree_discipline":["Electrical and Computer Engineering"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:14Z"}