Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 7th International Conference, CPAIOR 2010, Bolo by Andrea LodiIntegration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: 7th International Conference, CPAIOR 2010, Bolo by Andrea Lodi

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization…

byAndrea LodiEditorMichela Milano, Paolo Toth

Paperback | June 1, 2010

Pricing and Purchase Info

$125.55 online 
$150.50 list price save 16%
Earn 628 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This book constitutes the refereed proceedings of the 7th InternationalConference on Integration of AI and OR Techniques in ConstraintProgramming for Combinatorial Optimization Problems, CPAIOR 2010, held in Bologna, Italy, in June 2010.The 18 revised full papers and 17 revised short papers presentedtogether with the extended abstracts of 3 invited talks were carefullyreviewed and selected from 72 submissions. The papers are focused onboth theoretical and practical, application-oriented issues and presentcurrent research with a special focus on the integration andhybridization of the approaches of constraint programming, artificialintelligence, and operations research technologies for solving largescale and complex real life combinatorial optimization problems.
Title:Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization…Format:PaperbackDimensions:369 pagesPublished:June 1, 2010Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3642135196

ISBN - 13:9783642135194

Reviews

Table of Contents

Towards a MIP-Cut Metascheme.- Challenges for CPAIOR in Computational Sustainability.- Lazy Clause Generation: Combining the Power of SAT and CP (and MIP?) Solving.- On Matrices, Automata, and Double Counting.- The Increasing Nvalue Constraint.- Improving the Held and Karp Approach with Constraint Programming.- Characterization and Automation of Matching-Based Neighborhoods.- Rapid Learning for Binary Programs.- Hybrid Methods for the Multileaf Collimator Sequencing Problem.- Automatically Exploiting Subproblem Equivalence in Constraint Programming.- Single-Facility Scheduling over Long Time Horizons by Logic-Based Benders Decomposition.- Integrated Maintenance Scheduling for Semiconductor Manufacturing.- A Constraint Programming Approach for the Service Consolidation Problem.- Solving Connected Subgraph Problems in Wildlife Conservation.- Consistency Check for the Bin Packing Constraint Revisited.- A Relax-and-Cut Framework for Gomory's Mixed-Integer Cuts.- An In-Out Approach to Disjunctive Optimization.- A SAT Encoding for Multi-dimensional Packing Problems.- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach.- On the Design of the Next Generation Access Networks.- Vehicle Routing for Food Rescue Programs: A Comparison of Different Approaches.- Constraint Programming and Combinatorial Optimisation in Numberjack.- Automated Configuration of Mixed Integer Programming Solvers.- Upper Bounds on the Number of Solutions of Binary Integer Programs.- Matrix Interdiction Problem.- Strong Combination of Ant Colony Optimization with Constraint Programming Optimization.- Service-Oriented Volunteer Computing for Massively Parallel Constraint Solving Using Portfolios.- Constraint Programming with Arbitrarily Large Integer Variables.- Constraint-Based Local Search for Constrained Optimum Paths Problems.- Stochastic Constraint Programming by Neuroevolution with Filtering.- The Weighted Spanning Tree Constraint Revisited.- Constraint Reasoning with Uncertain Data Using CDF-Intervals.- Revisiting the Soft Global Cardinality Constraint.- A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.- Strategic Planning for Disaster Recovery with Stochastic Last Mile Distribution.- Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results.- Boosting Set Constraint Propagation for Network Design.- More Robust Counting-Based Search Heuristics with Alldifferent Constraints.