Screen LibraryIntegration of AI and OR techniques in constraint programming for combinatorial optimization problems : 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013 : proceedings /
This volume is a compilation of the research program of the 10th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2013, held at Yorktown Heights, NY, USA, in May 2013. This volume contains 20 full pa...
Saved in:
| Corporate Authors: | ; |
|---|---|
| Group Author: | ; |
| Published: |
Springer,
|
| Publisher Address: | Berlin ; New York : |
| Publication Dates: | 2013. |
| Literature type: | eBook |
| Language: | English |
| Series: |
Lecture notes in computer science,
7874 LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Subjects: | |
| Online Access: |
http://dx.doi.org/10.1007/978-3-642-38171-3 |
| Summary: |
This volume is a compilation of the research program of the 10th International Conference on the Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, CPAIOR 2013, held at Yorktown Heights, NY, USA, in May 2013. This volume contains 20 full papers and 11 short papers that were carefully reviewed and selected from 71 submissions. The papers focus on new techniques or applications in the intersection of constraint programming (CP), artificial intelligence (AI) and operations research (OR). |
| Carrier Form: | 1 online resource (xi, 402 p.) : ill. |
| Bibliography: | Includes bibliographical references and author index. |
| ISBN: |
9783642381713 (electronic bk.) 3642381715 (electronic bk.) |
| Index Number: | QA402 |
| CLC: | TP18-532 |
| Contents: |
Stronger Inference through Implied Literals from Conflicts and Knapsack Covers / Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling / Cloud Branching / Modeling Robustness in CSPs as Weighted CSPs / Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms / Revisiting Hyper Binary Resolution / Decision Diagrams and Dynamic Programming / CP Methods for Scheduling and Routing with Time-Dependent Task Costs / An MDD Approach to Multidimensional Bin Packing / A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint / Enumerating Infeasibility: Finding Multiple MUSes Quickly / Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem / Improved Discrete Reformulations for the Quadratic Assignment Problem / Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods / On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables / Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint / A Lagrangian Relaxation for Golomb Rulers / MiniZinc with Functions / Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming / The Rooted Maximum Node-Weight Connected Subgraph Problem / An Empirical Evaluation of Portfolios Approaches for Solving CSPs / Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling / A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem / A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects / Improving Strong Branching by Propagation / Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming / Tight LP-Relaxations of Overlapping Global Cardinality Constraints / An Adaptive Model Restarts Heuristic / Constraint-Based Fitness Function for Search-Based Software Testing / Coalition Formation for Servicing Dynamic Motion Tasks / Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization / |