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.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 3990Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2006Descripción: X, 301 p. Also available online. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783540343073Trabajos contenidos: SpringerLink (Online service)Tema(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 | CombinatoricsFormatos físicos adicionales: Sin títuloClasificación CDD: 518 Clasificación LoC:QA297-299.4Recursos en línea: de clik aquí para ver el libro electrónico 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.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.