Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Theoretical Computer Science and General Issues
Editat de J. Christopher Beck, Barbara Smithen Limba Engleză Paperback – 16 mai 2006
Din seria Theoretical Computer Science and General Issues
- 20%
Preț: 644.00 lei - 20%
Preț: 636.86 lei - 20%
Preț: 328.16 lei - 20%
Preț: 644.93 lei - 20%
Preț: 319.42 lei - 20%
Preț: 327.36 lei - 20%
Preț: 321.81 lei - 20%
Preț: 331.30 lei -
Preț: 380.46 lei - 20%
Preț: 324.99 lei -
Preț: 389.65 lei - 20%
Preț: 639.25 lei - 20%
Preț: 643.20 lei - 20%
Preț: 324.99 lei - 20%
Preț: 322.61 lei - 20%
Preț: 318.30 lei - 20%
Preț: 979.25 lei - 20%
Preț: 319.13 lei - 20%
Preț: 560.93 lei - 20%
Preț: 637.96 lei - 20%
Preț: 633.70 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 335.29 lei -
Preț: 391.54 lei - 20%
Preț: 733.68 lei - 20%
Preț: 326.55 lei - 20%
Preț: 328.16 lei - 20%
Preț: 323.41 lei - 20%
Preț: 316.28 lei - 20%
Preț: 630.51 lei - 20%
Preț: 326.55 lei - 20%
Preț: 326.55 lei - 20%
Preț: 328.16 lei - 20%
Preț: 320.24 lei - 20%
Preț: 641.62 lei - 20%
Preț: 321.81 lei - 20%
Preț: 793.92 lei - 20%
Preț: 552.18 lei -
Preț: 372.67 lei - 20%
Preț: 632.89 lei - 20%
Preț: 318.67 lei - 20%
Preț: 560.93 lei - 20%
Preț: 632.09 lei - 20%
Preț: 326.55 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 321.81 lei - 20%
Preț: 634.45 lei - 18%
Preț: 945.44 lei
Preț: 322.01 lei
Preț vechi: 402.51 lei
-20% Nou
Puncte Express: 483
Preț estimativ în valută:
56.98€ • 66.82$ • 50.04£
56.98€ • 66.82$ • 50.04£
Carte tipărită la comandă
Livrare economică 05-19 februarie 26
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 18 mm
Greutate: 0.48 kg
Ediția:2006
Editura: Springer
Seria Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540343067
Pagini: 316
Ilustrații: X, 301 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.48 kg
Ediția:2006
Editura: Springer
Seria Theoretical Computer Science and General Issues
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.