{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T02:57:56Z","timestamp":1761101876448},"reference-count":10,"publisher":"Elsevier","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1016\/s1570-7946(09)70108-7","type":"book-chapter","created":{"date-parts":[[2009,6,25]],"date-time":"2009-06-25T10:14:35Z","timestamp":1245924875000},"page":"647-652","source":"Crossref","is-referenced-by-count":2,"title":["Solving Nonlinear Problems with MILP Models"],"prefix":"10.1016","author":[{"given":"Jose Barahona","family":"da Fonseca","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1570-7946(09)70108-7_bib1","doi-asserted-by":"crossref","unstructured":"J. Barahona da Fonseca, \u201cFrom the Magic Square to the Optimization of Networks of AGVs and from MILP to an Improved GRASP like Optimization Algorithm\u201d, in Proceedings of CIMCA 06, IEEE Conference on Computational Intelligence for Modelling, Control and Automation, 181-186, 2006, available at IEEE Xplore database.","DOI":"10.1109\/CIMCA.2006.101"},{"key":"10.1016\/S1570-7946(09)70108-7_bib2","doi-asserted-by":"crossref","unstructured":"J. Barahona da Fonseca, \u201cCode Design as an Optimization Problem: from MILP to an Improved High Performance Randomized GRASP like Algorithm\u201d, in Proceedings of Escape-17, V. Plesu and P. S. Agachi (Eds), 279-284, 2007.","DOI":"10.1016\/S1570-7946(07)80070-8"},{"key":"10.1016\/S1570-7946(09)70108-7_bib3","first-page":"300","article-title":"\u201cAddition-Multiplication Magic Squares\u201d","volume":"18","author":"Horner","year":"1952","journal-title":"Scripta Math."},{"key":"10.1016\/S1570-7946(09)70108-7_bib4","first-page":"23","article-title":"\u201cAddition-Multiplication Magic Squares of Order 8\u201d","volume":"21","author":"Horner","year":"1955","journal-title":"Scripta Math."},{"key":"10.1016\/S1570-7946(09)70108-7_bib5","first-page":"27","article-title":"\u201cThe Magic Square as a Benchmark\u201d","volume":"18","author":"Barahona da Fonseca","year":"2006","journal-title":"International Journal of Computing Anticipatory Systems"},{"key":"10.1016\/S1570-7946(09)70108-7_bib6","unstructured":"T. Koch, Rapid Mathematical Programming, PhD thesis, Technische Universit\u00e4t Berlin, 2004."},{"key":"10.1016\/S1570-7946(09)70108-7_bib7","unstructured":"F. Lobo, The Parameter Less Genetic Algorithm, PhD thesis, New University of Lisbon, 2000."},{"key":"10.1016\/S1570-7946(09)70108-7_bib8","unstructured":"J. Barahona da Fonseca, \u201cTraining Hardlimit Multilayer Perceptrons with a MILP Model\u201d, paper submitted to ESANN 2009 conference."},{"key":"10.1016\/S1570-7946(09)70108-7_bib9","unstructured":"J. Barahona da Fonseca, \u201cGenerating Optimal Ternary Constant Weight Codes with a MILP Model\u201d, paper submitted to the IEEE Transactions on Information Theory."},{"key":"10.1016\/S1570-7946(09)70108-7_bib10","unstructured":"J. Barahona da Fonseca, \u201cGenerating University Timetables with a MILP Model\u201d, in Proceedings of Controlo 08, University of Tras-Os-Montes, Vila Real, Portugal, 2008."}],"container-title":["Computer Aided Chemical Engineering","19th European Symposium on Computer Aided Process Engineering"],"original-title":[],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T02:30:21Z","timestamp":1558405821000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570794609701087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1016\/s1570-7946(09)70108-7","relation":{},"ISSN":["1570-7946"],"issn-type":[{"value":"1570-7946","type":"print"}],"subject":[],"published":{"date-parts":[[2009]]}}}