Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Editat de Roman Barták, Michela Milanoen Limba Engleză Paperback – 20 mai 2005
Preț: 327.71 lei
Preț vechi: 409.63 lei
-20% Nou
Puncte Express: 492
Preț estimativ în valută:
57.98€ • 68.16$ • 50.78£
57.98€ • 68.16$ • 50.78£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
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 24 mm
Greutate: 0.65 kg
Ediția:2005
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540261524
Pagini: 428
Ilustrații: XII, 412 p.
Dimensiuni: 155 x 235 x 24 mm
Greutate: 0.65 kg
Ediția:2005
Editura: Springer
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.