Cantitate/Preț
Produs
Total produse
Vezi coșul
Integration of AI and OR Techniques in Constraint Programming de Laurent Michel

Integration of AI and OR Techniques in Constraint Programming: Lecture Notes in Computer Science, cartea 9075

Editat de Laurent Michel
en Limba Engleză Paperback – 22 apr 2015
This book constitutes the proceedings of the 12th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2015, held in Barcelona, Spain, in May 2015. The 29 papers presented together with 8 short papers in this volume were carefully reviewed and selected from 90 submissions. The purpose of the conference series is to bring together researchers in the fields of Constraint Programming, Artificial Intelligence and Operations Research to explore ways of solving hard and large scale combinatorial optimization problems that emerge in various industrial domains. Pooling the skills and strengths of this diverse group of researchers has proved extremely effective and valuable during the past decade leading to improvements and cross-fertilization between the three fields as well as breakthrough for actual applications.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 38722 lei

Puncte Express: 581

Carte tipărită la comandă

Livrare economică 10-24 august

Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 40000 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă

Specificații

ISBN-13: 9783319180076
ISBN-10: 331918007X
Pagini: 484
Ilustrații: XXV, 456 p. 87 illus.
Dimensiuni: 155 x 235 x 27 mm
Greutate: 0.73 kg
Ediția:2015
Editura: Springer
Colecția Lecture Notes in Computer Science
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Public țintă

Research

Cuprins

A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems.- Rectangle Placement for VLSI Testing.- A Constraint-Based Local Search for Edge Disjoint Rooted Distance-Constrained Minimum Spanning Tree Problem.- A Benders Approach to the Minimum Chordal Completion Problem.- MaxSAT-Based Scheduling of B2B Meetings.- Embedding Decision Trees and Random Forests in Constraint Programming.- Scheduling with Fixed Maintenance, Shared Resources and Nonlinear Feedrate Constraints: A Mine Planning Case Study.- Learning Value Heuristics for Constraint Programming.- Derivative-Free Optimization: Lifting Single-Objective to Multi-Objective Algorithm.- Branching on Multi-aggregated Variables.- Time-Table Disjunctive Reasoning for the Cumulative Constraint.- Uncertain Data Dependency Constraints in Matrix Models.- An Efficient Local Search for Partial Latin Square Extension Problem.- Enhancing MIP Branching Decisions by Using the Sample Variance of Pseudo Costs.- BDD-Guided Clause Generation.- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem.- Large Neighborhood Search for Energy Aware Meeting Scheduling in Smart Buildings.- ILP and CP Formulations for the Lazy Bureaucrat Problem.- The Smart Table Constraint.- Constraint-Based Sequence Mining Using Constraint Programming.- A Comparative Study of MIP and CP Formulations for the B2B Scheduling Optimization Problem.- Constraint-Based Local Search for Golomb Rulers.- Packing While Traveling: Mixed Integer Programming for a Class of Nonlinear Knapsack Problems.- MaxSAT-Based Cutting Planes for Learning Graphical Models.- A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW.- Constraint Solving on Bounded String Variables.- Freight Train Threading with Different Algorithms.- Learning General Constraints in CSP.- Understanding the Potential of Propagators.- Failure-Directed Search forConstraint-Based Scheduling.