{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,21]],"date-time":"2023-08-21T04:25:39Z","timestamp":1692591939264},"reference-count":36,"publisher":"Frontiers Media SA","content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Appl. Math. Stat."],"DOI":"10.3389\/fams.2016.00020","type":"journal-article","created":{"date-parts":[[2016,11,2]],"date-time":"2016-11-02T09:14:14Z","timestamp":1478078054000},"update-policy":"http:\/\/dx.doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Machine Learning Meliorates Computing and Robustness in Discrete Combinatorial Optimization Problems"],"prefix":"10.3389","volume":"2","author":[{"given":"Fushing","family":"Hsieh","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Fujii","sequence":"additional","affiliation":[]},{"given":"Cho-Jui","family":"Hsieh","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2016,11,1]]},"reference":[{"key":"B1","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","article-title":"The Hungarian method for the assignment problem","volume":"2","author":"Kuhn","year":"1955","journal-title":"Naval Res Logist Q."},{"key":"B2","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0105003","article-title":"Algorithms for the assignment and transportation problems","volume":"5","author":"Munkres","year":"1957","journal-title":"J Soc Indust Appl Math."},{"key":"B3","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611972238","volume-title":"Assignment Problems (Revised reprint).","author":"Burkard","year":"2012"},{"key":"B4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","article-title":"Dynamic programming treatment of the travelling salesman problem","volume":"9","author":"Bellman","year":"1962","journal-title":"J Assoc Comput Mach."},{"key":"B5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(77)90012-3","article-title":"The euclidean traveling salesman problem is NP-complete","volume":"4","author":"Papadimitriou","year":"1977","journal-title":"Theor Comput Sci."},{"key":"B6","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1145\/290179.290180","article-title":"Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems","volume":"45","author":"Arora","year":"1998","journal-title":"J ACM"},{"key":"B7","volume-title":"The Traveling Salesman Problem.","author":"Lawler","year":"1985"},{"key":"B8","volume-title":"The Traveling Salesman Problem.","author":"Applegate","year":"2006"},{"key":"B9","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1090\/S0273-0979-03-00975-3","article-title":"Patterns in eigenvalues: the 70th Josiah Willard Gibbs Lecture","volume":"40","author":"Diaconis","year":"2003","journal-title":"Bull Amer Math Soc."},{"key":"B10","doi-asserted-by":"publisher","first-page":"R1","DOI":"10.1088\/0305-4470\/36\/12\/201","article-title":"Introduction in review to special issue on random matrix theory","volume":"36","author":"Forrester","year":"2003","journal-title":"J Phys A Math Gen."},{"key":"B11","volume-title":"3rd Edn.","author":"Mehta","year":"2004"},{"key":"B12","doi-asserted-by":"crossref","DOI":"10.1142\/0271","volume-title":"Spin Glass Theory and Beyond.","author":"Mezard","year":"1986"},{"key":"B13","article-title":"A conjecture on random bipartite matching","author":"Parisi","year":"1998"},{"key":"B14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2007.11.062","article-title":"Random assignment problems","volume":"194","author":"Krokhmal","year":"2009","journal-title":"Eur J Oper Res."},{"key":"B15","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1287\/moor.2.3.209","article-title":"Probabilistic analysis of partitioning algoritms for the TSP in the plane","volume":"2","author":"Kapp","year":"1977","journal-title":"Math Oper. Res."},{"key":"B16","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"B17","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs I","volume":"6","author":"Erdos","year":"1959","journal-title":"Publ Math Debrecen"},{"key":"B18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs, 2nd Edn","author":"Bollob1s","year":"2001"},{"key":"B19","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1063\/1.1703773","article-title":"Statistical theory of the energy levels of complex systems-I","volume":"3","author":"Dyson","year":"1962","journal-title":"J Math Phys."},{"key":"B20","doi-asserted-by":"publisher","first-page":"061110","DOI":"10.1103\/PhysRevE.82.061110","article-title":"Time, temperature and data cloud geometry","volume":"82","author":"Fushing","year":"2010","journal-title":"Phys Rev E"},{"key":"B21","doi-asserted-by":"publisher","first-page":"e56259","DOI":"10.1371\/journal.pone.0056259","article-title":"Multi-scale clustering by building a robust and self-correcting ultrametric topology on data points","volume":"8","author":"Fushing","year":"2013","journal-title":"PLoS ONE"},{"key":"B22","doi-asserted-by":"publisher","first-page":"e106154","DOI":"10.1371\/journal.pone.0106154","article-title":"Data mechanics and coupling geometry on binary bipartite network","volume":"9","author":"Fushing","year":"2014","journal-title":"PLoS ONE"},{"key":"B23","doi-asserted-by":"publisher","first-page":"20150753","DOI":"10.1371\/journal.pone.0106154","article-title":"Unravelling the geometry of data matrices: effects of water stress regimes on winemaking","volume":"12","author":"Fushing","year":"2015","journal-title":"J R Soc Interface"},{"key":"B24","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1038\/nphys2190","article-title":"Between order and chaos","volume":"8","author":"Crutchfield","year":"2012","journal-title":"Nat Phys"},{"key":"B25","volume-title":"Stochastic Complexity and Statistical Inquiry","author":"Rissanen","year":"1989"},{"key":"B26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3860-5","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"Li","year":"1993"},{"key":"B27","article-title":"A divide-and-conquer solver for kernel support vector machines","volume-title":"International Conference on Machine Learning","author":"Hsieh","year":"2014"},{"key":"B28","article-title":"A divide-and-conquer method for sparse inverse covariance estimation","volume-title":"Advances in Neural Information Processing Systems","author":"Hsieh","year":"2012"},{"key":"B29","article-title":"Multi-scale spectral decomposition of massive graphs","volume-title":"Advances in Neural Information Processing Systems","author":"Si","year":"2014"},{"key":"B30","article-title":"Divide-and-conquer matrix factorization","volume-title":"Advances in Neural Information Processing Systems","author":"Mackey","year":"2011"},{"key":"B31","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1007\/s00453-009-9340-1","article-title":"A sequential algorithm for generating random graphs","volume":"58","author":"Bayati","year":"2010","journal-title":"Algorithmica"},{"key":"B32","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1198\/016214504000001303","article-title":"Sequential Monte Carlo methods for statistical analysis of tables","volume":"100","author":"Chen","year":"2005","journal-title":"J Am Stat Assoc."},{"key":"B33","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1017\/S0963548310000039","article-title":"What does a random contingency table look like?","volume":"19","author":"Barvinok","year":"2010","journal-title":"Combinator Probab Comput."},{"key":"B34","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1007\/s10955-014-1043-6","article-title":"Bootstrapping on undirected binary network via statistical mechanics","volume":"156","author":"Fushing","year":"2014","journal-title":"J Stat Phys."},{"key":"B35","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3389\/fams.2016.00009","article-title":"Mimicking directed binary networks for exploring systemic sensitivity: Is NCAA FBS a fragile competition system?","volume":"2","author":"Fushing","year":"2016","journal-title":"Front Appl Math Stat."},{"key":"B36","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/iccvw.2009.5457690","article-title":"Spectral Gromov-Wasserstein distances for shape matching","author":"M\u00e9moli","year":"2009","journal-title":"Proc ICCV Workshops"}],"container-title":["Frontiers in Applied Mathematics and Statistics"],"original-title":[],"link":[{"URL":"http:\/\/journal.frontiersin.org\/article\/10.3389\/fams.2016.00020\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,20]],"date-time":"2023-08-20T18:28:02Z","timestamp":1692556082000},"score":1,"resource":{"primary":{"URL":"http:\/\/journal.frontiersin.org\/article\/10.3389\/fams.2016.00020\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,1]]},"references-count":36,"URL":"https:\/\/doi.org\/10.3389\/fams.2016.00020","relation":{},"ISSN":["2297-4687"],"issn-type":[{"value":"2297-4687","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,1]]}}}