{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:35:55Z","timestamp":1761888955220,"version":"build-2065373602"},"reference-count":41,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["MINO"],"award-info":[{"award-number":["MINO"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006289","name":"\u00c9lectricit\u00e9 de France","doi-asserted-by":"publisher","award":["CIFRE"],"award-info":[{"award-number":["CIFRE"]}],"id":[{"id":"10.13039\/501100006289","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-10-BINF-0003"],"award-info":[{"award-number":["ANR-10-BINF-0003"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s13675-016-0069-8","type":"journal-article","created":{"date-parts":[[2016,6,15]],"date-time":"2016-06-15T12:37:27Z","timestamp":1465994247000},"page":"31-86","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["A multiplicative weights update algorithm for MINLP"],"prefix":"10.1016","volume":"5","author":[{"given":"Luca","family":"Mencarelli","sequence":"first","affiliation":[]},{"given":"Youcef","family":"Sahraoui","sequence":"additional","affiliation":[]},{"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-016-0069-8_CR1","doi-asserted-by":"crossref","unstructured":"Arora S, Hazan E, Kale S (2005) Fast algorithms for approximate semidefinite programming using the multiplicative weights update method. In: Foundations of Computer Science, vol\u00a046. FOCS, IEEE, New York, pp 339\u2013348","DOI":"10.1109\/SFCS.2005.35"},{"key":"10.1007\/s13675-016-0069-8_CR2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","article-title":"The multiplicative weights update method: a meta-algorithm and applications","volume":"8","author":"Arora","year":"2012","journal-title":"Theory Comput"},{"issue":"6","key":"10.1007\/s13675-016-0069-8_CR3","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1177\/0278364908100561","article-title":"Cooperative localization for autonomous underwater vehicles","volume":"28","author":"Bahr","year":"2009","journal-title":"Int J Robot Res"},{"issue":"11","key":"10.1007\/s13675-016-0069-8_CR4","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","article-title":"OR-Library: distributing test problems by electronic mail","volume":"41","author":"Beasley","year":"1990","journal-title":"J Oper Res Soc"},{"issue":"4","key":"10.1007\/s13675-016-0069-8_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF02404002","article-title":"Obtaining test problems via internet","volume":"8","author":"Beasley","year":"1996","journal-title":"J Glob Optim"},{"key":"10.1007\/s13675-016-0069-8_CR6","series-title":"Distance geometry: theory, methods, and applications","article-title":"Is the distance geometry problem in NP?","author":"Beeker","year":"2013"},{"key":"10.1007\/s13675-016-0069-8_CR7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/nar\/28.1.235","article-title":"The protein data bank","volume":"28","author":"Berman","year":"2000","journal-title":"Nucl Acid Res"},{"issue":"2","key":"10.1007\/s13675-016-0069-8_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02592208","article-title":"Computational study of a family of mixed-integer quadratic programming problems","volume":"74","author":"Bienstock","year":"1996","journal-title":"Math Program"},{"key":"10.1007\/s13675-016-0069-8_CR9","unstructured":"Bonami P, Lee J (2007) BONMIN user\u2019s manual. Technical report, IBM Corporation"},{"key":"10.1007\/s13675-016-0069-8_CR10","unstructured":"Bonami P, Lee J, Leyffer S, Waecher A (2011) More Branch-and-Bound experiments in convex nonlinear integer programming. Preprint ANL\/MCS-P1949-0911. Argonne National Laboratory, Mathematics and Computer Science Division"},{"key":"10.1007\/s13675-016-0069-8_CR11","doi-asserted-by":"crossref","unstructured":"Borghetti A, D\u2019Ambrosio C, Lodi A, Martello S (2015) Optimal scheduling of a multiunit hydro power station in a short-term planning horizon. In: Murty KG (ed) Case studies in operations research. International series in operations research & management science, vol 212, pp 167\u2013181. Springer, New York","DOI":"10.1007\/978-1-4939-1007-6_8"},{"year":"2004","series-title":"Convex optimization","author":"Boyd","key":"10.1007\/s13675-016-0069-8_CR12"},{"issue":"13","key":"10.1007\/s13675-016-0069-8_CR13","doi-asserted-by":"crossref","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","article-title":"Heuristics for cardinality constrained portfolio optimization","volume":"27","author":"Chang","year":"2000","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-016-0069-8_CR14","unstructured":"COIN-OR (2006) Introduction to IPOPT: a tutorial for downloading, installing, and using IPOPT"},{"key":"10.1007\/s13675-016-0069-8_CR15","doi-asserted-by":"crossref","unstructured":"Costa A, Hansen P, Liberti L (2010) Formulation symmetries incircle packing. In: Mahjoub R (ed) Proceedings of the international symposium on combinatorial optimization. Electronic notes in discrete mathematics, vol 36. Elsevier, Amsterdam, pp 1303\u20131310","DOI":"10.1016\/j.endm.2010.05.165"},{"key":"10.1007\/s13675-016-0069-8_CR16","unstructured":"D\u2019Ambrosio C, Ky Vu, Lavor C, Liberti L, Maculan N (2014) Solving distance geometry problems with interval data using formulation-based methods. Technical report, LIX Ecole Polytechnique (working paper)"},{"key":"10.1007\/s13675-016-0069-8_CR17","unstructured":"D\u2019Ambrosio C, Mencarelli L (2014) Complex portfolio selection via convex mixed-integer quadratic approaches: a survey. Technical report, LIX, \u00c9cole Polytechnique (working paper)"},{"key":"10.1007\/s13675-016-0069-8_CR18","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s11081-008-9072-0","article-title":"Sensor network localization, Euclidean distance matrix completions, and graph realization","volume":"11","author":"Ding","year":"2010","journal-title":"Optim Eng"},{"key":"10.1007\/s13675-016-0069-8_CR19","doi-asserted-by":"crossref","unstructured":"Du H, Alechina N, Stock K, Jackson M (2013) The logic of NEAR andFAR. In: Tenbrink T et al (ed) COSIT. LNCS, vol 8116. Springer, Switzerland, pp 475\u2013494","DOI":"10.1007\/978-3-319-01790-7_26"},{"issue":"1-3","key":"10.1007\/s13675-016-0069-8_CR20","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","article-title":"Local branching","volume":"98","author":"Fischetti","year":"2003","journal-title":"Math Program Ser B"},{"issue":"2","key":"10.1007\/s13675-016-0069-8_CR21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0594-3","article-title":"Perspective cuts for a class of convex 0-1 mixed integer programs","volume":"106","author":"Frangioni","year":"2006","journal-title":"Math Program Ser A"},{"issue":"12","key":"10.1007\/s13675-016-0069-8_CR22","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","article-title":"Branch-and-Bound experiments in convex nonlinear integer programming","volume":"31","author":"Gupta","year":"1985","journal-title":"Manag Sci"},{"key":"10.1007\/s13675-016-0069-8_CR23","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighbourhood search: principles and applications","volume":"130","author":"Hansen","year":"2001","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13675-016-0069-8_CR24","unstructured":"IBM (2010) ILOG CPLEX 12.2 User\u2019s Manual, IBM"},{"key":"10.1007\/s13675-016-0069-8_CR25","doi-asserted-by":"crossref","unstructured":"Kannan R, Monma CL (1978) On the computational complexity of integer programming problems. In: Henn R, Korte B, Oettli W (eds) Optimization and operations research. Lecture notes in economics and mathematical systems, vol 157, pp 161\u2013172. Springer, Berlin","DOI":"10.1007\/978-3-642-95322-4_17"},{"issue":"2","key":"10.1007\/s13675-016-0069-8_CR26","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/PL00011397","article-title":"Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints","volume":"89","author":"Konno","year":"2001","journal-title":"Math Program Ser B"},{"key":"10.1007\/s13675-016-0069-8_CR27","series-title":"Global optimization: scientific and engineering case studies","first-page":"213","article-title":"Computational experience with the molecular distance geometry problem","author":"Lavor","year":"2006"},{"issue":"1","key":"10.1007\/s13675-016-0069-8_CR28","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ro\/2009005","article-title":"Reformulations in mathematical programming: definitions and systematics","volume":"43","author":"Liberti","year":"2009","journal-title":"RAIRO-RO"},{"issue":"1","key":"10.1007\/s13675-016-0069-8_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1137\/120875909","article-title":"Euclidean distance geometry and applications","volume":"56","author":"Liberti","year":"2014","journal-title":"SIAM Rev"},{"key":"10.1007\/s13675-016-0069-8_CR30","series-title":"Distance geometry: theory, methods, and applications","article-title":"Distance geometry in structural biology","author":"Malliavin","year":"2013"},{"key":"10.1007\/s13675-016-0069-8_CR31","doi-asserted-by":"crossref","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) (2009) Hybridizing metaheuristics and mathematical programming. Annals of information systems, vol\u00a010. Springer, New York","DOI":"10.1007\/978-1-4419-1306-7"},{"issue":"1","key":"10.1007\/s13675-016-0069-8_CR32","first-page":"77","article-title":"Portfolio selection","volume":"7","author":"Markowitz","year":"1952","journal-title":"J Finan"},{"key":"10.1007\/s13675-016-0069-8_CR33","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","article-title":"Fast approximation algorithm for fractional packing and covering problems","volume":"20","author":"Plotkin","year":"1995","journal-title":"Math Oper Res"},{"key":"10.1007\/s13675-016-0069-8_CR34","unstructured":"Saxe J (1979) Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton conference in communications, control and computing, pp 480\u2013489"},{"year":"2005","series-title":"Introduction to modern portfolio optimization","author":"Scherer","key":"10.1007\/s13675-016-0069-8_CR35"},{"year":"2002","series-title":"Molecular modelling and simulation: an interdisciplinary guide","author":"Schlick","key":"10.1007\/s13675-016-0069-8_CR36"},{"issue":"3","key":"10.1007\/s13675-016-0069-8_CR37","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1080\/10556780701722542","article-title":"Lagrangian relaxation procedure for cardinality-constrained portfolio optimization","volume":"23","author":"Shaw","year":"2008","journal-title":"Optim Methods Softw"},{"key":"10.1007\/s13675-016-0069-8_CR38","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1016\/j.acha.2010.02.001","article-title":"Angular synchronization by eigenvectors and semidefinite programming","volume":"30","author":"Singer","year":"2011","journal-title":"Appl Comput Harmonic Anal"},{"issue":"1","key":"10.1007\/s13675-016-0069-8_CR39","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s40305-013-0004-0","article-title":"Recent advances in mathematical programming with semi-continuous variables and cardinality constraint","volume":"1","author":"Sun","year":"2013","journal-title":"J Oper Res Soc China"},{"key":"10.1007\/s13675-016-0069-8_CR40","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10288-014-0279-y","article-title":"Large-scale unit commitment under uncertainty: a literature survey","volume":"13","author":"Tahanan","year":"2015","journal-title":"4OR"},{"issue":"1","key":"10.1007\/s13675-016-0069-8_CR41","first-page":"1","article-title":"Mean-variance portfolio optimal problem under concave transaction cost","volume":"174","author":"Xue","year":"2006","journal-title":"Appl Math Comput"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-016-0069-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000745?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000745?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0069-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0069-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:38Z","timestamp":1761882398000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000745"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["S2192440621000745"],"URL":"https:\/\/doi.org\/10.1007\/s13675-016-0069-8","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A multiplicative weights update algorithm for MINLP","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-016-0069-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2017 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}