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] ] : 5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings / / edited by Laurent Perron, Michael A. Trick
| Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [[electronic resource] ] : 5th International Conference, CPAIOR 2008 Paris, France, May 20-23, 2008 Proceedings / / edited by Laurent Perron, Michael A. Trick |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XII, 394 p.) |
| Disciplina | 006.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Numerical analysis Computer science—Mathematics Discrete mathematics Algorithms Artificial intelligence Operations research Theory of Computation Numerical Analysis Discrete Mathematics in Computer Science Artificial Intelligence Operations Research and Decision Theory |
| ISBN | 3-540-68155-8 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Airline Scheduling: Accomplishments, Opportunities and Challenges -- Selected Challenges from Distribution and Commerce in the Airline and Travel Industry -- 30 Years of Constraint Programming -- Long Papers -- Constraint Integer Programming: A New Approach to Integrate CP and MIP -- New Filtering for the Constraint in the Context of Non-Overlapping Rectangles -- Multi-stage Benders Decomposition for Optimizing Multicore Architectures -- Fast and Scalable Domino Portrait Generation -- Gap Reduction Techniques for Online Stochastic Project Scheduling -- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver -- Cost Propagation – Numerical Propagation for Optimization Problems -- Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs -- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting -- The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems -- A Novel Approach For Detecting Symmetries in CSP Models -- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization -- Optimal Deployment of Eventually-Serializable Data Services -- Counting Solutions of Knapsack Constraints -- From High-Level Model to Branch-and-Price Solution in G12 -- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint -- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic -- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem -- Short Papers -- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection -- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts -- A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems -- Solving a Log-Truck Scheduling Problem with Constraint Programming -- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints -- Connections in Networks: A Hybrid Approach -- Efficient Haplotype Inference with Combined CP and OR Techniques -- Integration of CP and Compilation Techniques for Instruction Sequence Test Generation -- Propagating Separable Equalities in an MDD Store -- The Weighted Cfg Constraint -- CP with ACO -- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract) -- Constraint Optimization and Abstraction for Embedded Intelligent Systems -- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs -- Guiding Stochastic Search by Dynamic Learning of the Problem Topography -- Hybrid Variants for Iterative Flattening Search -- Global Propagation of Practicability Constraints -- The Polytope of Tree-Structured Binary Constraint Satisfaction Problems -- A Tabu Search Method for Interval Constraints -- The Steel Mill Slab Design Problem Revisited -- Filtering Atmost1 on Pairs of Set Variables -- Extended Abstract -- Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints. |
| Record Nr. | UNISA-996465591103316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 5th international conference, CPAIOR 2008, Paris, France, May 20-23, 2008 : proceedings / / Laurent Perron, Michael A. Trick (eds.)
| Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : 5th international conference, CPAIOR 2008, Paris, France, May 20-23, 2008 : proceedings / / Laurent Perron, Michael A. Trick (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2008 |
| Descrizione fisica | 1 online resource (XII, 394 p.) |
| Disciplina | 006.3 |
| Altri autori (Persone) |
PerronLaurent
TrickMichael A |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Constraints (Artificial intelligence)
Constraint programming (Computer science) Combinatorial optimization - Data processing Operations research - Technique Artificial intelligence - Technique |
| ISBN | 3-540-68155-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Talks -- Airline Scheduling: Accomplishments, Opportunities and Challenges -- Selected Challenges from Distribution and Commerce in the Airline and Travel Industry -- 30 Years of Constraint Programming -- Long Papers -- Constraint Integer Programming: A New Approach to Integrate CP and MIP -- New Filtering for the Constraint in the Context of Non-Overlapping Rectangles -- Multi-stage Benders Decomposition for Optimizing Multicore Architectures -- Fast and Scalable Domino Portrait Generation -- Gap Reduction Techniques for Online Stochastic Project Scheduling -- Integrating Symmetry, Dominance, and Bound-and-Bound in a Multiple Knapsack Solver -- Cost Propagation – Numerical Propagation for Optimization Problems -- Fitness-Distance Correlation and Solution-Guided Multi-point Constructive Search for CSPs -- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting -- The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems -- A Novel Approach For Detecting Symmetries in CSP Models -- Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization -- Optimal Deployment of Eventually-Serializable Data Services -- Counting Solutions of Knapsack Constraints -- From High-Level Model to Branch-and-Price Solution in G12 -- Simpler and Incremental Consistency Checking and Arc Consistency Filtering Algorithms for the Weighted Spanning Tree Constraint -- Stochastic Satisfiability Modulo Theories for Non-linear Arithmetic -- A Hybrid Constraint Programming / Local Search Approach to the Job-Shop Scheduling Problem -- Short Papers -- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection -- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts -- A Hybrid Approach for Solving Shift-Selection and Task-Sequencing Problems -- Solving a Log-Truck Scheduling Problem with Constraint Programming -- Using Local Search to Speed Up Filtering Algorithms for Some NP-Hard Constraints -- Connections in Networks: A Hybrid Approach -- Efficient Haplotype Inference with Combined CP and OR Techniques -- Integration of CP and Compilation Techniques for Instruction Sequence Test Generation -- Propagating Separable Equalities in an MDD Store -- The Weighted Cfg Constraint -- CP with ACO -- A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract) -- Constraint Optimization and Abstraction for Embedded Intelligent Systems -- A Parallel Macro Partitioning Framework for Solving Mixed Integer Programs -- Guiding Stochastic Search by Dynamic Learning of the Problem Topography -- Hybrid Variants for Iterative Flattening Search -- Global Propagation of Practicability Constraints -- The Polytope of Tree-Structured Binary Constraint Satisfaction Problems -- A Tabu Search Method for Interval Constraints -- The Steel Mill Slab Design Problem Revisited -- Filtering Atmost1 on Pairs of Set Variables -- Extended Abstract -- Mobility Allowance Shuttle Transit (MAST) Services: MIP Formulation and Strengthening with Logic Constraints. |
| Altri titoli varianti |
International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimisation Problems
Integration of artificial intelligence and operations research techniques in constraint programming for combinatorial optimization problems CPAIOR 2008 |
| Record Nr. | UNINA-9910483327903321 |
| Berlin ; ; New York, : Springer, c2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Practice and theory of automated timetabling V : 5th international conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004 : revised selected papers / / Edmund Burke, Michael Trick (eds.)
| Practice and theory of automated timetabling V : 5th international conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004 : revised selected papers / / Edmund Burke, Michael Trick (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2005 |
| Descrizione fisica | 1 online resource (XII, 360 p.) |
| Disciplina | 004/.33 |
| Altri autori (Persone) |
BurkeEdmund, Ph. D.
TrickMichael A |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Constraints (Artificial intelligence)
Scheduling - Data processing |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | General Issues -- Learning User Preferences in Distributed Calendar Scheduling -- Semantic Components for Timetabling -- An Open Interactive Timetabling Tool -- Distributed Choice Function Hyper-heuristics for Timetabling and Scheduling -- Transport Timetabling -- A Hybridised Integer Programming and Local Search Method for Robust Train Driver Schedules Planning -- Logistics Service Network Design for Time-Critical Delivery -- University Course Timetabling -- The University Course Timetabling Problem with a Three-Phase Approach -- Minimal Perturbation Problem in Course Timetabling -- Feature Selection in a Fuzzy Student Sectioning Algorithm -- A Column Generation Scheme for Faculty Timetabling -- School Timetabling -- Decomposition and Parallelization of Multi-resource Timetabling Problems -- Interactively Solving School Timetabling Problems Using Extensions of Constraint Programming -- A Tiling Algorithm for High School Timetabling -- Project Scheduling -- Lower Bounds for the Multi-skill Project Scheduling Problem with Hierarchical Levels of Skills -- Examination Timetabling -- A Novel Similarity Measure for Heuristic Selection in Examination Timetabling -- A Tabu Search Hyper-heuristic Approach to the Examination Timetabling Problem at the MARA University of Technology -- A Hybrid Multi-objective Evolutionary Algorithm for the Uncapacitated Exam Proximity Problem -- Examination Timetabling with Fuzzy Constraints -- Fuzzy Multiple Heuristic Orderings for Examination Timetabling. |
| Altri titoli varianti |
Practice and theory of automated timetabling 5
Practice and theory of automated timetabling five |
| Record Nr. | UNINA-9910768449903321 |
| Berlin, : Springer, 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||