Page 1
Page 1
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; Vol.3990 ; 3rd International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings
Constitutes the refereed proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2006. The 20 revised full papers presented together with 3 invited talks address methodological and foundational issues from AI, OR, and algorithmics and present applications to the solution of combinatorial optimization problems in various fields via constraint programming.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems ; Vol.3524 : 2nd International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005
Intended primarily as a forum to focus on the integration and hybridization of the approaches of constraint programming (CP), arti?cial intelligence (AI), and operations research (OR) technologies for solving large-scale and complex real-life optimization problems. Therefore, CPAIOR is never far from industrial applications. The high number of submissions received this year, almost 100 papers, in witness to the interest of the research community in this conference. From these submissions, we chose 26 to be published in full in the proceedings. This volume includes summaries of the invited talks of CPAIOR: one from industry, one from the embedded system research community, and one from the operations research community.
Integer programming and combinatorial optimization ; 9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings
This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27–29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.
Integer programming and combinatorial optimization ; 13th International Conference, IPCO 2008 Bertinoro, Italy, May 26-28, 2008 Proceedings
The volume contains the papers selected for presentation at IPCO 2008, the 13th International Conference on Integer Programming and Combinatorial - timization that was held in Bertinoro (Italy), May 26–28, 2008. The IPCO series of conferences, sponsored by the Mathematical Progr- ming Society, highlights recent developments in theory, computation, and app- cation of integer programming and combinatorial optimization. The frst conf- ence took place in 1990; starting from IPCO 1995, the proceedings are published in the Lecture Notes in Computer Science series. The 12 previous IPCO conferences were held in Waterloo (Canada) 1990.
Integer programming and combinatorial optimization ; 12th International IPCO Conference, Ithaca, NY, USA, June 25-27, 2007, Proceedings
Constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007. This book presents 36 revised full papers that were reviewed and selected from over 120 submissions.
Integer Programming and Combinatorial Optimization ; 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings
Since its start in 1990, the IPCO conference series (held under the auspices of theMathematicalProgrammingSociety)hasbecomeanimportantforumforthe presentation of recent results in Integer Programming and Combinatorial Op- mization. This volume compiles the papers presented at IPCO XI, the eleventh conference in this series, held June 8–10, 2005, at the Technische Universit¨ at Berlin. The high interest in this conference series is evident in the large number of submissions. For IPCO XI, 119 extended abstracts of up to 10 pages were submitted. During its meeting on January 29–30, 2005, the Program Committee carefully selected 34 contributions for presentation in non-parallel sessions at the conference. The ?nal choices were not easy at all, since, due to the limited number of time slots, many very good papers could not be accepted. During the selection process the contributions were refereed according to the standards of refereed conferences. As a result of this procedure, you have in your hands a volume that contains papers describing high-quality research e?orts. The page limit for contributions to this proceedings volume was set to 15. You may ?nd full versions of the papers in scienti?c journals in the near future. We thank all the authors who submitted papers. Furthermore, the Program Committee is indebted to the many reviewers who, with their speci?c expertise, helped a lot in making the decisions.
Evolutionary computation in combinatorial optimization ; 8th European Conference, EvoCOP 2008, Naples, Italy, March 26-28, 2008. Proceedings
Metaheuristics have been shown to be e?ective for di?cult combinatorial - timization problems appearing in various industrial, economical, and scientifc domains. Prominent examples of metaheuristics are evolutionary algorithms, tabu search, simulated annealing, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, ant colony optimization and estimation of distribution algorithms. Problems solved successfully include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman pr- lem, packing and cutting, satisfability and general mixed integer programming.
Algorithms – ESA 2005 ; 13th Annual European Symposium, Palma de Mallorca, Spain, October 3-6, 2005, Proceedings
This volume contains the 75 contributed papers and the abstracts of the threeinvited lectures presented at the 13th Annual European Symposium on Algo-rithms (ESA 2005), held in Spain, 2005. respectively.Papers were solicited in all areas of algorithmic research, including but notlimited to algorithmic aspects of networks, approximation and on-line algo-rithms, computational biology, computational geometry, computational financeand algorithmic game theory, data structures, database and information re-trieval, external memory algorithms, graph algorithms, graph drawing, machinelearning, mobile computing, pattern matching and data compression, quantumcomputing, and randomized algorithms. The algorithms could be sequential,distributed, or parallel. Submissions were especially encouraged in the area ofmathematical programming and operations research, including combinatorialoptimization, integer programming, polyhedral combinatorics, and semidefiniteprogramming.Each extended abstract was submitted to one of the two tracks.
