{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:01:30Z","timestamp":1778644890878,"version":"3.51.4"},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100010665","name":"H2020 Marie Sk\u0142odowska-Curie Actions","doi-asserted-by":"publisher","award":["764759"],"award-info":[{"award-number":["764759"]}],"id":[{"id":"10.13039\/100010665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014028","name":"H2020","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100014028","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007601","name":"Horizon 2020","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100007601","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1016\/j.orl.2021.05.001","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T11:47:27Z","timestamp":1620215247000},"page":"447-451","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial programming prevents aircraft (and other) conflicts"],"prefix":"10.1016","volume":"49","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-6341-8143","authenticated-orcid":false,"given":"Martina","family":"Cerulli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0003-3139-6821","authenticated-orcid":false,"given":"Leo","family":"Liberti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2021.05.001_br0060","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1287\/trsc.2014.0557","article-title":"Exact and approximate solving of the aircraft collision resolution problem via turn changes","volume":"50","author":"Alonso-Ayuso","year":"2016","journal-title":"Transp. Sci."},{"issue":"6","key":"10.1016\/j.orl.2021.05.001_br0110","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":"4\u20135","key":"10.1016\/j.orl.2021.05.001_br0220","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","article-title":"Branching and bounds tightening techniques for non-convex minlp","volume":"24","author":"Belotti","year":"2009","journal-title":"Optim. Methods Softw."},{"issue":"3","key":"10.1016\/j.orl.2021.05.001_br0030","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10898-017-0560-7","article-title":"Feasibility pump for aircraft deconfliction with speed regulation","volume":"71","author":"Cafieri","year":"2018","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.orl.2021.05.001_br0020","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10898-013-0070-1","article-title":"Aircraft deconfliction with speed regulation: new models from mixed-integer optimization","volume":"58","author":"Cafieri","year":"2014","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.orl.2021.05.001_br0180","series-title":"Advances in Optimization and Decision Science for Society, Services and Enterprises","first-page":"197","article-title":"Flying safely by bilevel programming","author":"Cerulli","year":"2019"},{"key":"10.1016\/j.orl.2021.05.001_br0150","doi-asserted-by":"crossref","DOI":"10.1007\/s10898-021-00997-1","article-title":"Detecting and solving aircraft conflicts using bilevel programming","author":"Cerulli","year":"2021","journal-title":"J. Glob. Optim."},{"issue":"3","key":"10.1016\/j.orl.2021.05.001_br0230","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","article-title":"The NEOS server","volume":"5","author":"Czyzyk","year":"1998","journal-title":"IEEE J. Comput. Sci. Eng."},{"key":"10.1016\/j.orl.2021.05.001_br0240","series-title":"Mathematics and Computer Science Division","article-title":"The NEOS server 4.0 administrative guide, technical memorandum ANL\/MCS-TM-250","author":"Dolan","year":"2001"},{"key":"10.1016\/j.orl.2021.05.001_br0010","series-title":"En route air traffic soft management ultimate system","year":"2009"},{"key":"10.1016\/j.orl.2021.05.001_br0190","series-title":"AMPL: A Modeling Language for Mathematical Programming","author":"Fourer","year":"2002"},{"key":"10.1016\/j.orl.2021.05.001_br0250","series-title":"Approximation Theory and Optimization","first-page":"167","article-title":"Optimization environments and the NEOS server","author":"Gropp","year":"1997"},{"key":"10.1016\/j.orl.2021.05.001_br0200","series-title":"Gurobi Optimizer Reference Manual","year":"2020"},{"issue":"3","key":"10.1016\/j.orl.2021.05.001_br0090","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BF01582235","article-title":"An implementation of a discretization method for semi-infinite programming","volume":"34","author":"Hettich","year":"1986","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.orl.2021.05.001_br0100","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","article-title":"The cutting-plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"10.1016\/j.orl.2021.05.001_br0120","series-title":"Proceedings of the 14th European Conference on the Mathematics of Oil Recovery","first-page":"A38","article-title":"A mixed-integer nonlinear optimization approach for well placement and geometry","volume":"vol. XIV","author":"Lizon","year":"2014"},{"issue":"1","key":"10.1016\/j.orl.2021.05.001_br0040","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1109\/6979.994791","article-title":"Conflict resolution problems for air traffic management systems solved with mixed integer programming","volume":"3","author":"Pallottino","year":"2002","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"issue":"2","key":"10.1016\/j.orl.2021.05.001_br0050","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1016\/j.ejor.2014.08.045","article-title":"Solving air traffic conflict problems via local continuous optimization","volume":"241","author":"Peyronne","year":"2015","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.orl.2021.05.001_br0080","volume":"vol. 25","year":"1998"},{"key":"10.1016\/j.orl.2021.05.001_br0070","series-title":"IEEE 56th Annual Conference on Decision and Control","first-page":"88","article-title":"Complex number formulation and convex relaxations for aircraft conflict resolution","author":"Rey","year":"2017"},{"key":"10.1016\/j.orl.2021.05.001_br0140","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1109\/TSP.2019.2959260","article-title":"Kinetic Euclidean distance matrices","volume":"68","author":"Tabaghi","year":"2020","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.orl.2021.05.001_br0170","series-title":"NSIPS version 2.1 nonlinear semi-infinite programming solver","author":"Vaz","year":"2004"},{"key":"10.1016\/j.orl.2021.05.001_br0210","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","article-title":"On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming","volume":"106","author":"W\u00e4chter","year":"2006","journal-title":"Math. Program."},{"key":"10.1016\/j.orl.2021.05.001_br0130","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s10589-013-9612-1","article-title":"Semidefinite relaxations for semi-infinite polynomial programming","volume":"58","author":"Wang","year":"2014","journal-title":"Comput. Optim. Appl."},{"issue":"3","key":"10.1016\/j.orl.2021.05.001_br0160","first-page":"603","article-title":"On solving a class of linear semi-infinite programming by SDP method","volume":"64","author":"Xu","year":"2015","journal-title":"Optimization"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637721000638?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S0167637721000638?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T22:36:09Z","timestamp":1759098969000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637721000638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["S0167637721000638"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2021.05.001","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Polynomial programming prevents aircraft (and other) conflicts","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.orl.2021.05.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}