Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems [electronic resource] : 4th International Conference, CPAIOR 2007, Brussels, Belgium, May 23-26, 2007. Proceedings / edited by Pascal Hentenryck, Laurence Wolsey.

By: Hentenryck, Pascal [editor.]Contributor(s): Wolsey, Laurence [editor.] | SpringerLink (Online service)Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science: 4510Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2007Description: X, 391 p. Also available online. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783540723974Subject(s): Computer science | Computer software | Electronic data processing | Computational complexity | Artificial intelligence | Combinatorics | Computer Science | Numeric Computing | Discrete Mathematics in Computer Science | Algorithm Analysis and Problem Complexity | Artificial Intelligence (incl. Robotics) | Operations Research/Decision Theory | CombinatoricsAdditional physical formats: Printed edition:: No titleDDC classification: 518 LOC classification: QA297-299.4Online resources: Click here to access online
Contents:
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches -- Connections in Networks: Hardness of Feasibility Versus Optimality -- Modeling the Regular Constraint with Integer Programming -- Hybrid Local Search for Constrained Financial Portfolio Selection Problems -- The “Not-Too-Heavy Spanning Tree” Constraint -- Eliminating Redundant Clauses in SAT Instances -- Cost-Bounded Binary Decision Diagrams for 0-1 Programming -- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs -- A Global Constraint for Total Weighted Completion Time -- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method -- Necessary Condition for Path Partitioning Constraints -- A Constraint Programming Approach to the Hospitals / Residents Problem -- Best-First AND/OR Search for 0/1 Integer Programming -- A Position-Based Propagator for the Open-Shop Problem -- Directional Interchangeability for Enhancing CSP Solving -- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production -- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost -- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search -- The Deviation Constraint -- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width -- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint -- Solving a Stochastic Queueing Control Problem with Constraint Programming -- Constrained Clustering Via Concavity Cuts -- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem -- A Large Neighborhood Search Heuristic for Graph Coloring -- Generalizations of the Global Cardinality Constraint for Hierarchical Resources -- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.
In: Springer eBooksSummary: This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007. The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
No physical items for this record

Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches -- Connections in Networks: Hardness of Feasibility Versus Optimality -- Modeling the Regular Constraint with Integer Programming -- Hybrid Local Search for Constrained Financial Portfolio Selection Problems -- The “Not-Too-Heavy Spanning Tree” Constraint -- Eliminating Redundant Clauses in SAT Instances -- Cost-Bounded Binary Decision Diagrams for 0-1 Programming -- YIELDS: A Yet Improved Limited Discrepancy Search for CSPs -- A Global Constraint for Total Weighted Completion Time -- Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method -- Necessary Condition for Path Partitioning Constraints -- A Constraint Programming Approach to the Hospitals / Residents Problem -- Best-First AND/OR Search for 0/1 Integer Programming -- A Position-Based Propagator for the Open-Shop Problem -- Directional Interchangeability for Enhancing CSP Solving -- A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production -- Replenishment Planning for Stochastic Inventory Systems with Shortage Cost -- Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search -- The Deviation Constraint -- The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width -- On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint -- Solving a Stochastic Queueing Control Problem with Constraint Programming -- Constrained Clustering Via Concavity Cuts -- Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem -- A Large Neighborhood Search Heuristic for Graph Coloring -- Generalizations of the Global Cardinality Constraint for Hierarchical Resources -- A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems.

This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007. The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.

There are no comments on this title.

to post a comment.

Implemented and Maintained by Biju Patnaik Central Library.
For any Suggestions/Query Contact to library or Email: library@nitrkl.ac.in OR bpcl-cir@nitrkl.ac.in. Ph:91+6612462103
Website/OPAC best viewed in Mozilla Browser in 1366X768 Resolution.

Powered by Koha