Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [electronic resource] : Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006. Proceedings / edited by J. Christopher Beck, Barbara M. Smith.

By: Beck, J. Christopher [editor.]Contributor(s): Smith, Barbara M [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 3990Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Description: X, 301 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540343073Subject(s): Computer science | Computer software | Electronic data processing | Computational complexity | Artificial intelligence | Combinatorics | Computer Science | Numeric Computing | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Artificial Intelligence (incl. Robotics) | Operations Research/Decision Theory | CombinatoricsAdditional physical formats: Printed edition:: No titleDDC classification: 518 LOC classification: QA297-299.4Online resources: Click here to access online
Contents:
Invited Talks -- Opt Art -- Planning for Mixed Discrete Continuous Domains -- Duality in Optimization and Constraint Satisfaction -- Technical Papers -- A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming -- Undirected Forest Constraints -- Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs -- The Range Constraint: Algorithms and Implementation -- On the Separability of Subproblems in Benders Decompositions -- A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem -- The Power of Semidefinite Programming Relaxations for MAX-SAT -- Expected-Case Analysis for Delayed Filtering -- Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming -- Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP -- AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems -- The Timetable Constrained Distance Minimization Problem -- Conflict-Directed A* Search for Soft Constraints -- Event-Driven Probabilistic Constraint Programming -- Online Stochastic Reservation Systems -- Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling -- Open Constraints in a Closed World -- Conditional Lexicographic Orders in Constraint Satisfaction Problems -- An Efficient Hybrid Strategy for Temporal Planning -- Improved Algorithm for the Soft Global Cardinality Constraint.
In: Springer eBooksSummary: This volume contains the proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Com- natorial Optimization Problems (CPAIOR 2006). The conference was held in Cork, Ireland, from May 31 to June 2, 2006. Information about the conference can be found athttp://tidel.mie.utoronto.ca/cpaior/.Previous meetings inthisseriesincludetwointernationalconferencesheldinNice(2004)andPrague (2005)and?veinternationalworkshopsheldinheldinFerrara(1999),Paderborn (2000), Ashford (2001), Le Croisic (2002), and Montreal (2003). The goal of these meetings is to provide a forum for researchers to present approaches which highlight the integration of CP, AI, and OR techniques. An additional important goal is to allow researchers from diverse backgrounds to learn about techniques in other areas that are used for solving combinatorial optimization problems and therefore to encourage cross-fertilization. One m- sure of the success that has been enjoyed by these meetings is the number of publications outside this conference series (e.g., at the International Conference onthe PrinciplesandPracticeofConstraintProgramming)that directlyexplore integrated approaches to solving large and di?cult combinatorial problems.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

Invited Talks -- Opt Art -- Planning for Mixed Discrete Continuous Domains -- Duality in Optimization and Constraint Satisfaction -- Technical Papers -- A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming -- Undirected Forest Constraints -- Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs -- The Range Constraint: Algorithms and Implementation -- On the Separability of Subproblems in Benders Decompositions -- A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem -- The Power of Semidefinite Programming Relaxations for MAX-SAT -- Expected-Case Analysis for Delayed Filtering -- Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming -- Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP -- AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems -- The Timetable Constrained Distance Minimization Problem -- Conflict-Directed A* Search for Soft Constraints -- Event-Driven Probabilistic Constraint Programming -- Online Stochastic Reservation Systems -- Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling -- Open Constraints in a Closed World -- Conditional Lexicographic Orders in Constraint Satisfaction Problems -- An Efficient Hybrid Strategy for Temporal Planning -- Improved Algorithm for the Soft Global Cardinality Constraint.

This volume contains the proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Com- natorial Optimization Problems (CPAIOR 2006). The conference was held in Cork, Ireland, from May 31 to June 2, 2006. Information about the conference can be found athttp://tidel.mie.utoronto.ca/cpaior/.Previous meetings inthisseriesincludetwointernationalconferencesheldinNice(2004)andPrague (2005)and?veinternationalworkshopsheldinheldinFerrara(1999),Paderborn (2000), Ashford (2001), Le Croisic (2002), and Montreal (2003). The goal of these meetings is to provide a forum for researchers to present approaches which highlight the integration of CP, AI, and OR techniques. An additional important goal is to allow researchers from diverse backgrounds to learn about techniques in other areas that are used for solving combinatorial optimization problems and therefore to encourage cross-fertilization. One m- sure of the success that has been enjoyed by these meetings is the number of publications outside this conference series (e.g., at the International Conference onthe PrinciplesandPracticeofConstraintProgramming)that directlyexplore integrated approaches to solving large and di?cult combinatorial problems.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha