Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings: Lecture Notes in Computer Science, cartea 3011
Editat de Jean-Charles Régin, Michel Rueheren Limba Engleză Paperback – 7 apr 2004
Din seria Lecture Notes in Computer Science
- 20% Preț: 1021.30 lei
- 20% Preț: 337.03 lei
- 20% Preț: 340.22 lei
- 20% Preț: 256.27 lei
- 20% Preț: 324.32 lei
- 20% Preț: 438.69 lei
- 20% Preț: 315.78 lei
- 20% Preț: 327.52 lei
- 20% Preț: 148.66 lei
- 20% Preț: 122.89 lei
- 20% Preț: 557.41 lei
- 20% Preț: 561.37 lei
- 15% Preț: 558.56 lei
- 20% Preț: 238.01 lei
- 20% Preț: 504.57 lei
- 20% Preț: 329.09 lei
- 20% Preț: 563.75 lei
- 20% Preț: 630.24 lei
- 20% Preț: 321.96 lei
- 20% Preț: 1361.10 lei
- 20% Preț: 310.26 lei
- 20% Preț: 607.39 lei
- Preț: 366.90 lei
- 20% Preț: 172.69 lei
- 20% Preț: 315.19 lei
- 20% Preț: 985.59 lei
- 20% Preț: 620.87 lei
- 20% Preț: 436.22 lei
- 20% Preț: 734.34 lei
- 20% Preț: 1034.49 lei
- 17% Preț: 360.19 lei
- 20% Preț: 309.90 lei
- 20% Preț: 573.92 lei
- 20% Preț: 301.95 lei
- 20% Preț: 307.71 lei
- 20% Preț: 369.12 lei
- 20% Preț: 327.52 lei
- 20% Preț: 794.65 lei
- 20% Preț: 569.16 lei
- Preț: 395.43 lei
- 20% Preț: 1138.26 lei
- 20% Preț: 734.34 lei
- 20% Preț: 315.78 lei
- 20% Preț: 330.70 lei
- 20% Preț: 538.29 lei
- 20% Preț: 326.98 lei
Preț: 326.57 lei
Preț vechi: 408.21 lei
-20% Nou
Puncte Express: 490
Preț estimativ în valută:
62.50€ • 65.94$ • 52.09£
62.50€ • 65.94$ • 52.09£
Carte tipărită la comandă
Livrare economică 02-16 ianuarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540218364
ISBN-10: 354021836X
Pagini: 432
Ilustrații: XI, 420 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354021836X
Pagini: 432
Ilustrații: XI, 420 p.
Dimensiuni: 155 x 235 x 23 mm
Greutate: 0.61 kg
Ediția:2004
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Paper.- Using MILP and CP for the Scheduling of Batch Chemical Processes.- Technical Papers.- SIMPL: A System for Integrating Optimization Techniques.- A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times.- Simple Rules for Low-Knowledge Algorithm Selection.- Filtering Algorithms for the Same Constraint.- Cost Evaluation of Soft Global Constraints.- SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems.- Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming.- Generating Benders Cuts for a General Class of Integer Programming Problems.- A Constraint Programming Model for Tail Assignment.- Super Solutions in Constraint Programming.- Local Probing Applied to Network Routing.- Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights.- Filtering Methods for Symmetric Cardinality Constraint.- Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints.- Combining Forces to Solve the Car Sequencing Problem.- Travelling in the World of Local Searches in the Space of Partial Assignments.- A Global Constraint for Nesting Problems.- Models and Symmetry Breaking for ‘Peaceable Armies of Queens’.- A Global Constraint for Graph Isomorphism Problems.- Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem.- Scheduling Abstractions for Local Search.- O(nlog n) Filtering Algorithms for Unary Resource Constraint.- Problem Decomposition for Traffic Diversions.- Short Papers.- LP Relaxations of Multiple all_different Predicates.- Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming.- MakingChoices Using Structure at the Instance Level within a Case Based Reasoning Framework.- The Challenge of Generating Spatially Balanced Scientific Experiment Designs.- Building Models through Formal Specification.- Stabilization Issues for Constraint Programming Based Column Generation.- A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem.