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 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems : second international conference, CPAIOR 2005, Prague, Czech Republic, May 30-June 1, 2005 : proceedings / / Roman Bartak, Michela Milano (eds.) |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, : Springer, 2005 |
Descrizione fisica | 1 online resource (XII, 412 p.) |
Disciplina | 005.1/16 |
Altri autori (Persone) |
BartakRoman
MilanoMichela |
Collana | Lecture notes in computer science |
Soggetto topico |
Constraints (Artificial intelligence)
Constraint programming (Computer science) Combinatorial optimization Artificial intelligence - Technique Operations research |
ISBN | 9783540322641 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Invited Papers -- Integration of Rules and Optimization in Plant PowerOps -- Embedded Systems Design: Optimization Challenges -- Models for Solving the Travelling Salesman Problem -- Technical Papers -- Set Variables and Local Search -- The Temporal Knapsack Problem and Its Solution -- Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles -- The tree Constraint -- Filtering Algorithms for the NValue Constraint -- Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming -- A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems -- On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price -- Constraint Programming Based Column Generation for Employee Timetabling -- Scheduling Social Golfers Locally -- Multiconsistency and Robustness with Global Constraints -- Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations -- Shorter Path Constraints for the Resource Constrained Shortest Path Problem -- Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation -- Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price -- A Search-Infer-and-Relax Framework for Integrating Solution Methods -- Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs -- Symmetry Breaking and Local Search Spaces -- Combination of Among and Cardinality Constraints -- On the Tractability of Smooth Constraint Satisfaction Problems -- A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems -- Symmetry and Search in a Network Design Problem -- Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems -- Formulations and Reformulations in Integer Programming -- Nondeterministic Control for Hybrid Search -- Computing Explanations for the Unary Resource Constraint. |
Altri titoli varianti |
Integration of artificial intelligence and operations research techniques in constraint programming for combinatorial optimization problems
CPAIOR 2005 |
Record Nr. | UNINA-9910483618003321 |
Berlin, : Springer, 2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|