Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings / / edited by Jean-Charles Régin, Michel Rueher
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : First International Conference, CPAIOR 2004, Nice, France, April 20-22, 2004, Proceedings / / edited by Jean-Charles Régin, Michel Rueher |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIII, 415 p.) |
| Disciplina | 005.1/16 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Numerical analysis Computer science—Mathematics Algorithms Artificial intelligence Operations research Decision making Software Engineering/Programming and Operating Systems Numeric Computing Discrete Mathematics in Computer Science Algorithm Analysis and Problem Complexity Artificial Intelligence Operations Research/Decision Theory |
| ISBN |
1-280-30804-4
9786610308040 3-540-24664-9 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNISA-996465541803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
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 / / edited by Jean-Charles Régin, Michel Rueher
| 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 / / edited by Jean-Charles Régin, Michel Rueher |
| Edizione | [1st ed. 2004.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 |
| Descrizione fisica | 1 online resource (XIII, 415 p.) |
| Disciplina | 005.1/16 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Software engineering
Numerical analysis Computer science - Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Software Engineering Numerical Analysis Discrete Mathematics in Computer Science Artificial Intelligence Operations Research and Decision Theory |
| ISBN |
1-280-30804-4
9786610308040 3-540-24664-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 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. |
| Record Nr. | UNINA-9910144194503321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2004 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||