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
Başlık:
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
ISBN:
9783540246640
Edition:
1st ed. 2004.
Yayın Bilgileri:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2004.
Fiziksel Tanımlama:
XIII, 415 p. online resource.
Series:
Lecture Notes in Computer Science, 3011
Contents:
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 -- Making Choices 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.
Ek Kurum Yazarı:
Elektronik Erişim:
Full Text Available From Springer Nature Computer Science Archive Packages
Dil:
English