Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 31 -- June 1, 2005: Lecture Notes in Computer Science, cartea 3524
Editat de Roman Barták, Michela Milanoen Limba Engleză Paperback – 20 mai 2005
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 340.32 lei
- 20% Preț: 341.95 lei
- 20% Preț: 453.32 lei
- 20% Preț: 238.01 lei
- 20% Preț: 340.32 lei
- 20% Preț: 438.69 lei
- Preț: 449.57 lei
- 20% Preț: 343.62 lei
- 20% Preț: 148.66 lei
- 20% Preț: 310.26 lei
- 20% Preț: 256.27 lei
- 20% Preț: 645.28 lei
- 17% Preț: 427.22 lei
- 20% Preț: 655.02 lei
- 20% Preț: 307.71 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 591.51 lei
- Preț: 381.21 lei
- 20% Preț: 337.00 lei
- 15% Preț: 438.59 lei
- 20% Preț: 607.39 lei
- 20% Preț: 538.29 lei
- Preț: 389.48 lei
- 20% Preț: 326.98 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 575.48 lei
- 20% Preț: 583.40 lei
- 20% Preț: 763.23 lei
- 15% Preț: 580.46 lei
- 17% Preț: 360.19 lei
- 20% Preț: 504.57 lei
- 20% Preț: 172.69 lei
- 20% Preț: 369.12 lei
- 20% Preț: 353.50 lei
- 20% Preț: 585.88 lei
- Preț: 410.88 lei
- 20% Preț: 596.46 lei
- 20% Preț: 763.23 lei
- 20% Preț: 825.93 lei
- 20% Preț: 649.49 lei
- 20% Preț: 350.21 lei
- 20% Preț: 309.90 lei
- 20% Preț: 122.89 lei
Preț: 338.68 lei
Preț vechi: 423.35 lei
-20% Nou
Puncte Express: 508
Preț estimativ în valută:
64.82€ • 66.87$ • 54.86£
64.82€ • 66.87$ • 54.86£
Carte tipărită la comandă
Livrare economică 05-19 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540261520
ISBN-10: 3540261524
Pagini: 428
Ilustrații: XII, 412 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2005
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
ISBN-10: 3540261524
Pagini: 428
Ilustrații: XII, 412 p.
Dimensiuni: 155 x 235 x 22 mm
Greutate: 0.59 kg
Ediția:2005
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ă
ResearchCuprins
Invited Papers.- Integration of Rules and Optimization in Plant PowerOps.- Embedded Systems Design: Optimization Challenges.- Models for Solving the Travelling Salesman Problem.- Technical Papers.- Set Variables and Local Search.- The Temporal Knapsack Problem and Its Solution.- Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles.- The tree Constraint.- Filtering Algorithms for the NValue Constraint.- Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming.- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems.- On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price.- Constraint Programming Based Column Generation for Employee Timetabling.- Scheduling Social Golfers Locally.- Multiconsistency and Robustness with Global Constraints.- Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations.- Shorter Path Constraints for the Resource Constrained Shortest Path Problem.- Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation.- Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price.- A Search-Infer-and-Relax Framework for Integrating Solution Methods.- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs.- Symmetry Breaking and Local Search Spaces.- Combination of Among and Cardinality Constraints.- On the Tractability of Smooth Constraint Satisfaction Problems.- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems.- Symmetry and Search in a Network Design Problem.- Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems.- Formulations and Reformulations in Integer Programming.- Nondeterministic Control for Hybrid Search.- Computing Explanations for the Unary Resource Constraint.