{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:38:44Z","timestamp":1767638324731,"version":"3.48.0"},"reference-count":12,"publisher":"Maximum Academic Press","issue":"3","license":[{"start":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T00:00:00Z","timestamp":1343260800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2012,9]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>The European air traffic flow management problem poses particular challenges on optimization technology as it requires detailed modelling and rapid online optimization capabilities. Constraint programming proved successful in addressing these challenges for departure time slot allocation by offering fine-grained modelling of resource constraints and fast allocation through heuristic-repair strategies.<\/jats:p>","DOI":"10.1017\/s0269888912000240","type":"journal-article","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:43:52Z","timestamp":1343281432000},"page":"333-342","source":"Crossref","is-referenced-by-count":3,"title":["Air traffic flow management with heuristic repair"],"prefix":"10.48130","volume":"27","author":[{"given":"Ulrich","family":"Junker","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2012,7,26]]},"reference":[{"volume-title":"Integer and Combinatorial Optimization","year":"1999","author":"Wolsey","key":"S0269888912000240_ref12"},{"volume-title":"The Handbook of Constraint Programming","year":"2006","author":"Rossi","key":"S0269888912000240_ref11"},{"key":"S0269888912000240_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90007-K"},{"key":"S0269888912000240_ref9","doi-asserted-by":"crossref","unstructured":"Junker U. 2007. Preference-based problem solving for constraint programming. In Proceedings of the CSCLP 2007, 109\u2013126. Rocquencourt, France.","DOI":"10.1007\/978-3-540-89812-2_8"},{"key":"S0269888912000240_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jairtraman.2007.05.001"},{"key":"S0269888912000240_ref6","unstructured":"Dalichampt M. , Petit E. , Junker U. , Lebreton J. 1997. Innovative Slot Allocation. Executive summary of EEC report no. 322, Eurocontrol Experimental Centre."},{"key":"S0269888912000240_ref3","unstructured":"Bertsimas D. , Stock S. 1994. The Air Traffic Flow Management Problem with Enroute Capacities. MIT-report. MIT."},{"key":"S0269888912000240_ref1","unstructured":"Barnier N. , Brisset P. , Rivi\u00e8re T. 2001. Slot allocation with constraint programming: models and results. In International Air Traffic Management R&D Seminar ATM-2001. Santa Fe (NM), USA."},{"volume-title":"Limited discrepancy search","year":"1995","author":"Harvey","key":"S0269888912000240_ref8"},{"volume-title":"Basic CFMU Handbook\u2014General and CFMU Systems","year":"2009","key":"S0269888912000240_ref5"},{"key":"S0269888912000240_ref2","doi-asserted-by":"crossref","unstructured":"Bertsimas D. , Lulli G. , Odoni A. R. 2008. The air traffic flow management problem: an integer optimization approach. In Proceedings of the IPCO, 34\u201346. Bertinoro, Italy.","DOI":"10.1007\/978-3-540-68891-4_3"},{"key":"S0269888912000240_ref4","doi-asserted-by":"crossref","unstructured":"Chevaleyre Y. , Endriss U. , Lang J. , Maudet N. 2007. A short introduction to computational social choice. In Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 51\u201369. Springer.","DOI":"10.1007\/978-3-540-69507-3_4"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888912000240","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:44:07Z","timestamp":1767624247000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888912000240\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,26]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2012,7,26]]}},"alternative-id":["S0269888912000240"],"URL":"https:\/\/doi.org\/10.1017\/s0269888912000240","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2012,7,26]]}}}