{"id":388,"date":"2021-03-15T14:32:12","date_gmt":"2021-03-15T18:32:12","guid":{"rendered":"https:\/\/people.clas.ufl.edu\/hager\/?page_id=388"},"modified":"2026-03-19T08:18:26","modified_gmt":"2026-03-19T12:18:26","slug":"partitioning","status":"publish","type":"page","link":"https:\/\/people.clas.ufl.edu\/hager\/partitioning\/","title":{"rendered":"Partitioning"},"content":{"rendered":"\r\n<section class=\"fullwidth-text-block\">\r\n\t<div class=\"container px-0 pt-5\">\r\n\t\t<div class=\"row align-items-start\">\r\n\t\t\t<div class=\"col-12\">\r\n\t\t\t\t\n<h1 class=\"wp-block-heading\">Partitioning<\/h1>\n\n\n\n\n\n\n\n<ul class=\"wp-block-list\"><li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">Timothy A. Davis, William W. Hager, Scott P. Kolodziej, and S. Nuri Yeralan,<\/a>\u00a0Algorithm 1003: Mongoose, A Graph Coarsening and Partitioning Library, ACM Transactions on Mathematical Software, 46 (2020), issue 1, article 7, pp. 1-18. (https:\/\/doi.org\/10.1145\/3337792)<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager, J. T. Hungerford, and I. Safro,<\/a>\u00a0A Multilevel Bilinear Programming Algorithm for the Vertex Separator Problem,\u00a0Computational Optimization and Applications, Vol. 69 (2018), pp. 189-223. DOI 10.1007\/s10589-017-9945-2<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager and J. T. Hungerford,<\/a>\u00a0Continuous Quadratic Programming Formulations of Optimization Problems on Graphs, European Journal of Operational Research, Vol. 240 (2015), pp. 328-337.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager and J. T. Hungerford,<\/a>\u00a0Optimality conditions for maximizing a function over a polyhedron, Mathematical Programming, 145 (2014), pp. 179-198. doi: 10.1007\/s10107-013-0644-1<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager, D. Phan, and H. Zhang,<\/a>\u00a0An exact algorithm for graph partitioning,\u00a0Mathematical Programming, 137 (2013), pp. 531-556 (DOI 10.1007\/s10107-011-0503-x).<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">S. C. Park, T. A. Davis, W. W. Hager, H. Zhang,<\/a>\u00a0Quadratic programming techniques in graph partitioning, Nov 14, 2006.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager and Y. Krylyuk,<\/a>\u00a0Multiset graph partitioning, Mathematical Methods of Operations Research, 55 (2002), 1-10.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager, S. C. Park, and T. A. Davis,<\/a>\u00a0Block exchange in graph partitioning (in Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, P. M. Pardalos, ed., Kluwer, 2000, pp. 299-307)<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager and Y. Krylyuk,<\/a>\u00a0Graph partitioning and continuous quadratic programming (SIAM Journal on Discrete Mathematics, 12 (1999), pp. 500-523).<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/content-removed\/\">W. W. Hager,<\/a>\u00a0Minimizing the profile of a matrix, SIAM Journal on Scientific Computing, 28 (2002), pp. 1799-1816.<\/li>\n<li><a href=\"https:\/\/people.clas.ufl.edu\/hager\/files\/profile_testsets.txt\">Profile Test Sets<\/a><\/li><\/ul>\n\n\n\n\n\n\n\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t<\/div>\r\n<\/section>\r\n","protected":false},"excerpt":{"rendered":"","protected":false},"author":1075,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"featured_post":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-388","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/pages\/388","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/users\/1075"}],"replies":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/comments?post=388"}],"version-history":[{"count":4,"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/pages\/388\/revisions"}],"predecessor-version":[{"id":822,"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/pages\/388\/revisions\/822"}],"wp:attachment":[{"href":"https:\/\/people.clas.ufl.edu\/hager\/wp-json\/wp\/v2\/media?parent=388"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}