Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Third International Conference, CPAIOR 2006, . Computer Science and General Issues)

Beck, J. Christopher [Editor]; Smith, Barbara [Editor];

ISBN 10: 3540343067 / ISBN 13: 9783540343066

Editore: Springer, 2006

Riguardo questo articolo

We are unable to ship to Canada at this time.Ex-library paperback in very nice condition with the usual markings and attachments. Except for library markings, interior clean and unmarked. Tight binding.

Codice articolo DA1411350

Dati bibliografici

• Titolo: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Third International Conference, CPAIOR 2006, . Computer Science and General Issues)
• Editore: Springer
• Data di pubblicazione: 2006
• Lingua: Inglese
• ISBN 10: 3540343067
• ISBN 13: 9783540343066
• Rilegatura: Paperback
• Condizione: Very Good
• Peso: 17 once

Descrizione articolo

Riassunto

This book 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.

Contenuti

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.