Integration of AI and OR Techniques in Constraint Programming: 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings PDF
Preview Integration of AI and OR Techniques in Constraint Programming: 13th International Conference, CPAIOR 2016, Banff, AB, Canada, May 29 - June 1, 2016, Proceedings
Claude-Guy Quimper (Ed.) Integration 6 7 6 of AI and OR Techniques 9 S C in Constraint Programming N L 13th International Conference, CPAIOR 2016 Banff, AB, Canada, May 29 – June 1, 2016 Proceedings 123 Lecture Notes in Computer Science 9676 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, Lancaster, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Friedemann Mattern ETH Zurich, Zürich, Switzerland John C. Mitchell Stanford University, Stanford, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Dortmund, Germany Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbrücken, Germany More information about this series at http://www.springer.com/series/7407 Claude-Guy Quimper (Ed.) Integration of AI and OR Techniques in Constraint Programming 13th International Conference, CPAIOR 2016 – Banff, AB, Canada, May 29 June 1, 2016 Proceedings 123 Editor Claude-Guy Quimper UniversitéLaval Quebec, QC Canada ISSN 0302-9743 ISSN 1611-3349 (electronic) Lecture Notesin Computer Science ISBN 978-3-319-33953-5 ISBN978-3-319-33954-2 (eBook) DOI 10.1007/978-3-319-33954-2 LibraryofCongressControlNumber:2016937948 LNCSSublibrary:SL1–TheoreticalComputerScienceandGeneralIssues ©SpringerInternationalPublishingSwitzerland2016 Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartofthe material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodologynow knownorhereafterdeveloped. Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant protectivelawsandregulationsandthereforefreeforgeneraluse. Thepublisher,theauthorsandtheeditorsaresafetoassumethattheadviceandinformationinthisbookare believedtobetrueandaccurateatthedateofpublication.Neitherthepublishernortheauthorsortheeditors give a warranty, express or implied, with respect to the material contained herein or for any errors or omissionsthatmayhavebeenmade. Printedonacid-freepaper ThisSpringerimprintispublishedbySpringerNature TheregisteredcompanyisSpringerInternationalPublishingAGSwitzerland Preface The 13th International Conference on Integration of Artificial Intelligence and Oper- ations Research Techniques in Constraint Programming, was held in Banff, Canada, May 29 to June 1, 2016. It was co-located with CORS 2016, the conference of the Canadian Operational Research Society. Theaimoftheconferenceistobringtogetherinterestedresearchersfromconstraint programming(CP),artificialintelligence(AI),andoperationsresearch(OR)topresent new techniques or applications in combinatorial optimization and to provide an opportunityforresearchersinoneareatolearnabouttechniquesintheothers.Amain objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems. Therefore, papers that actively combine, integrate, or contrast approaches from more than one of the areas were especially solicited.High-qualitypapersfromasingleareawerealsowelcome,providedthatthey are of interest to other communities involved. Application papers showcasing CP/AI/OR techniques on novel and challenging applications or experience reports on such applications were strongly encouraged. Therewere51paperssubmitted.Eachpaperreceivedatleastthreeindependentpeer reviews. From this process, 33 papers were accepted. Among these accepted papers, four were published in the journal Constraints. The conference included an invited talk given by Pascal Van Hentenryck. The first dayoftheconferencewasaMasterClassaboutdecompositionmethods.Jean-François Cordeau, John Hooker, Christopher Beck, Bernard Gendron, Willem-Jan van Hoeve, and Louis-Martin Rouseau gave a one-hour talk on topics covering the classic and logic-basedBendersdecomposition,theLagrangianrelaxationinMIPandCP,aswell as column generation. March 2016 Claude-Guy Quimper Organization Program Committee Chris Beck University of Toronto, Canada Nicolas Beldiceanu TASC (CNRS/Inria), Mines Nantes, France David Bergman University of Connecticut, USA Lucas Bordeaux Microsoft Research, UK Andre Cire University of Toronto Scarborough, Canada Jean-Guillaume Fages COSLING S.A.S., France Bernard Gendron Université de Montréal, Canada Tias Guns KU Leuven, Belgium Emmanuel Hebrard LAAS, CNRS, France John Hooker Carnegie Mellon University, USA George Katsirelos INRA, Toulouse, France Philip Kilby NICTA and the Australian National University, Australia Andrea Lodi École Polytechnique de Montréal, Canada Michele Lombardi DISI, University of Bologna, Italy Laurent Michel University of Connecticut, USA Barry O’Sullivan 4C, University College Cork, Ireland Gilles Pesant École Polytechnique de Montréal, Canada Claude-Guy Quimper Université Laval, Canada Jean-Charles Regin University of Nice-Sophia Antipolis/I3S/CNRS, France Louis-Martin Rousseau École Polytechnique de Montréal, Canada Pierre Schaus UC Louvain, Belgium Christian Schulte KTH Royal Institute of Technology, Sweden Meinolf Sellmann IBM Research, USA Paul Shaw IBM, France Peter J. Stuckey University of Melbourne, Australia Pascal Van Hentenryck University of Michigan, USA Willem-Jan Van Hoeve Carnegie Mellon University, USA Petr Vilím IBM, Czech Republic Mark Wallace Monash University, Australia Toby Walsh NICTA and UNSW, Australia Additional Reviewers Bal, Deepak Carbonnel, Clément Borghesi, Andrea Cardonha, Carlos Borghetti, Alberto Carlsson, Mats Bridi, Thomas Castañeda Lozano, Roberto VIII Organization den Hertog, Dick Lhomme, Olivier Fontaine, Daniel Malapert, Arnaud Gay, Steven Monaci, Michele Harabor, Daniel Perez, Guillaume Hendel, Gregor Salvagnin, Domenico Huguet, Marie-José Siala, Mohamed Johnson, Greg Tjandraatmadja, Christian Kelly, Richard Tran, Tony T. Kinable, Joris Tubertini, Paolo Ku, Wen-Yang Yunes, Tallys Abstracts of Fast Tracked Journal Papers Breaking Symmetries in Graph Coloring Problems with Degree Matrices: The Ramsey Number R(4, 3, 3) = 30 Michael Codish1, Michael Frank1, Avraham Itzhakov1, and Alice Miller2 1Department of Computer Science, Ben-Gurion University of theNegev, Beersheba,Israel 2 Schoolof Computing Science, University of Glasgow,Glasgow, Scotland Ramsey numbers are notoriously hard graph coloring problems. An ðr ;...;r ;nÞ 1 k RamseycoloringisagraphcoloringinkcolorsofthecompletegraphK thatdoesnot n contain a monochromatic complete sub-graph K in color i for each 1(cid:2)i(cid:2)k. The set ri of all such colorings is denoted Rðr ;...;r ;nÞ. The Ramsey number Rðr ;...;r Þ is 1 k 1 k the least n[0 such that no ðr ;...;r ;nÞ coloring exists. 1 k TheRamseynumberRð4;3;3ÞisoftenpresentedastheunknownRamseynumber with the best chance of being found “soon”. Yet, its precise value has remained unknown for more than 50 years. This paper presents a methodology based on ab- stractionandsymmetrybreakingthatisdemonstratedbyusingittocomputethevalue Rð4;3;3Þ¼30. It was previously known that 30(cid:2)Rð4;3;3Þ(cid:2)31 [4]. Kalbfleisch [2] proved in 1966thatRð4;3;3Þ(cid:3)30,Piwakowski[3]provedin1997thatRð4;3;3Þ(cid:2)32,andone year later Piwakowski and Radziszowski [4] proved that Rð4;3;3Þ(cid:2)31. We demon- stratehowourmethodologyappliestocomputationallyprovethatRð4;3;3Þ¼30.Our approach involves applying an embedding technique to conclude that if a ð4;3;3;30Þ Ramseycoloringexiststhenitmustbeh13;8;8iregular.Todetermineifthereexistsa h13;8;8iregular ð4;3;3;30ÞRamsey coloringrequired first computingthepreviously unknown set Rð3;3;3;13Þ, which was shown to have size 78,892. To do this we demonstrate that an existing symmetry breaking technique combining SAT solving with symmetry breaking [1] works for smaller instances but not for Rð3;3;3;13Þ. Instead we use a new abstraction referred to as degree matrices. Having determined Rð3;3;3;13Þwethenuseitwithintheembeddingapproachtoachievethemajorresult of this paper: that there is no ð4;3;3;30Þ Ramsey coloring, and so Rð4;3;3Þ¼30. Supported by the Israel Science Foundation, grant 82/13. Computational resources provided byanIBMShared University Award(Israel).
Description:The list of books you might like
