Cantitate/Preț
Produs

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings: Lecture Notes in Computer Science, cartea 3990

Editat de J. Christopher Beck, Barbara Smith
en Limba Engleză Paperback – 16 mai 2006
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. This book presents 20 revised full papers together with 3 invited talks that address methodological and foundational issues from AI, OR, and algorithmics.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32783 lei

Preț vechi: 40978 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6274 6536$ 5216£

Carte tipărită la comandă

Livrare economică 10-24 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540343066
ISBN-10: 3540343067
Pagini: 316
Ilustrații: X, 301 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.45 kg
Ediția:2006
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.