By Christos T. Maravelias, Ignacio E. Grossmann (auth.), Jean-Charles Régin, Michel Rueher (eds.)
This e-book constitutes the refereed lawsuits of the 1st overseas convention on Integration of AI and OR ideas in Constraint Programming for Combinatorial Optimization difficulties, CPAIOR 2004, held in great, France in April 2004.
The 23 revised complete papers and seven revised brief papers awarded including an invited speak have been conscientiously reviewed and chosen from fifty six submissions. Methodological and foundational matters from AI, OR, and algorithmics are awarded in addition to purposes to the answer of combinatorial optimization difficulties in a variety of fields through constraint programming.
Read or Download Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004. Proceedings PDF
Similar international conferences and symposiums books
Robotics is on the cusp of dramatic transformation. more and more complicated robots with exceptional autonomy are discovering new functions, from scientific surgical procedure, to building, to domestic prone. by contrast historical past, the algorithmic foundations of robotics have gotten extra an important than ever, with the intention to construct robots which are quickly, secure, trustworthy, and adaptive.
Evolutionary Computing: AISB Workshop Sheffield, UK, April 3–4, 1995 Selected Papers
This quantity is predicated at the Workshop on Evolutionary Computing held in Sheffield, U. okay. , in April 1995 below the sponsorship of the Society for the research of man-made Intelligence and Simulation of habit (AISB). The 18 complete papers offered have been chosen in the course of a post-workshop refereeing assembly and selected from 32 submissions for the workshop.
This booklet constitutes the refereed court cases of the IFIP-TC6 8th - ternational convention on own instant Communications, PWC 2003. PWC 2003 is the ? agship convention of the IFIP operating team 6. eight, cellular and instant Communications, and is the most effective foreign discussion board for discussions among researchers, practitioners, and scholars drawn to the symbiosis of cellular computing and instant networks.
This publication constitutes the refereed court cases of the sixth FIP WG 2. 2 foreign convention, TCS 2010, held as part of the 21th international laptop Congress, WCC 2010, in Brisbane, Australia, in September 2010. The 23 revised complete papers provided, including four invited talks, have been rigorously reviewed and chosen from 39 submissions.
- Genetic Programming: 6th European Conference, EuroGP 2003 Essex, UK, April 14–16, 2003 Proceedings
- Quantum Information V: Proceedings of the Fifth Conference, Meijo University, Japan 17 - 19 December 2001
- Complex Analysis and Potential Theory: Proceedings of the Conference Satellite to ICM 2006, Gebze Institute of Technology, Turkey, 8 - 14 September 2006
- Field-Programmable Logic and Applications From FPGAs to Computing Paradigm: 8th International Workshop, FPL '98 Tallinn, Estonia, August 31–September 3, 1998 Proceedings
- Object-Oriented Methodologies and Systems: International Symposium, ISOOMS '94 Palermo, Italy, September 21–22, 1994 Proceedings
- Stochastic analysis: Proc. of the Durham symposium, 1990
Additional info for Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004. Proceedings
Sample text
6 outlines some additional features provided by SIMPL, and Sect. 7 discusses directions for future work. 2 Previous Work A comprehensive survey of the literature on the cooperation of logic-based, Constraint Programming (CP) and Operations Research (OR) methods can be found in [15]. g. Benders [3]) that solve parts of the problem with different techniques [10,14, 19, 21, 24, 33]; allowing different models/solvers to exchange information [32]; using linear programming to reduce the domains of variables or to fix them to certain values [4, 11, 32]; automatic reformulation of global constraints as systems of linear inequalities [30]; continuous relaxations of global constraints and disjunctions of linear systems [1, 14, 18, 22, 28, 36, 37, 38]; understanding the generation of cutting planes as a form of logical inference [6, 7]; strengthening the problem formulation by embedding the generation of valid cutting planes into CP constraints [12]; maintaining the continuous relaxation of a constraint updated when the domains of its variables change [29]; and using global constraints as a key component in the intersection of CP and OR [27].
Numerische Mathematik, 4:238–252, 1962. [4] H. Beringer and B. de Backer. Combinatorial problem solving in constraint logic programming with cooperating solvers. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications. Elsevier Science, 1995. [5] M. Berkelaar. LP_SOLVE. nl/pub/lp_solve/. [6] A. Bockmayr and F. Eisenbrand. Combining logic and optimization in cutting plane theory. In H. Kirchner and C. Ringeissen, editors, Proceedings of the Third International Workshop on Frontiers of Combining Systems (FroCos), LNAI1794, 1–17.
Osorio. Mixed logical/linear programming. Discrete Applied Mathematics, 96–97(1–3):395–442, 1999. [19] J. N. Hooker and G. Ottosson. Logic-based benders decomposition. Mathematical Programming, 96:33–60, 2003. N. Hooker, G. Ottosson, E. -J. Kim. On integrating constraint propagation and linear programming for combinatorial optimization. In Proceedings of the 16th National Conference on Artificial Intelligence, pages 136–141. MIT Press, 1999. [21] J. N. Hooker and H. Yan. Logic circuit verification by Benders decomposition.