Ebook: Integration 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 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).

---

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).

---

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).
Content:
Front Matter....Pages -
Stronger Inference through Implied Literals from Conflicts and Knapsack Covers....Pages 1-11
Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling....Pages 12-27
Cloud Branching....Pages 28-43
Modeling Robustness in CSPs as Weighted CSPs....Pages 44-60
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms....Pages 61-76
Revisiting Hyper Binary Resolution....Pages 77-93
Decision Diagrams and Dynamic Programming....Pages 94-110
CP Methods for Scheduling and Routing with Time-Dependent Task Costs....Pages 111-127
An MDD Approach to Multidimensional Bin Packing....Pages 128-143
A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint....Pages 144-159
Enumerating Infeasibility: Finding Multiple MUSes Quickly....Pages 160-175
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem....Pages 176-192
Improved Discrete Reformulations for the Quadratic Assignment Problem....Pages 193-203
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods....Pages 204-215
On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables....Pages 216-233
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint....Pages 234-250
A Lagrangian Relaxation for Golomb Rulers....Pages 251-267
MiniZinc with Functions....Pages 268-283
Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming....Pages 284-299
The Rooted Maximum Node-Weight Connected Subgraph Problem....Pages 300-315
An Empirical Evaluation of Portfolios Approaches for Solving CSPs....Pages 316-324
Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling....Pages 325-331
A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem....Pages 332-339
A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects....Pages 340-346
Improving Strong Branching by Propagation....Pages 347-354
Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming....Pages 355-361
Tight LP-Relaxations of Overlapping Global Cardinality Constraints....Pages 362-368
An Adaptive Model Restarts Heuristic....Pages 369-377
Constraint-Based Fitness Function for Search-Based Software Testing....Pages 378-385
Coalition Formation for Servicing Dynamic Motion Tasks....Pages 386-393
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization....Pages 394-402
Back Matter....Pages -

---

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).
Content:
Front Matter....Pages -
Stronger Inference through Implied Literals from Conflicts and Knapsack Covers....Pages 1-11
Recent Improvements Using Constraint Integer Programming for Resource Allocation and Scheduling....Pages 12-27
Cloud Branching....Pages 28-43
Modeling Robustness in CSPs as Weighted CSPs....Pages 44-60
Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms....Pages 61-76
Revisiting Hyper Binary Resolution....Pages 77-93
Decision Diagrams and Dynamic Programming....Pages 94-110
CP Methods for Scheduling and Routing with Time-Dependent Task Costs....Pages 111-127
An MDD Approach to Multidimensional Bin Packing....Pages 128-143
A Synchronized Sweep Algorithm for the k-dimensional cumulative Constraint....Pages 144-159
Enumerating Infeasibility: Finding Multiple MUSes Quickly....Pages 160-175
Tuning Parameters of Large Neighborhood Search for the Machine Reassignment Problem....Pages 176-192
Improved Discrete Reformulations for the Quadratic Assignment Problem....Pages 193-203
Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods....Pages 204-215
On Solving Mixed-Integer Constraint Satisfaction Problems with Unbounded Variables....Pages 216-233
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint....Pages 234-250
A Lagrangian Relaxation for Golomb Rulers....Pages 251-267
MiniZinc with Functions....Pages 268-283
Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming....Pages 284-299
The Rooted Maximum Node-Weight Connected Subgraph Problem....Pages 300-315
An Empirical Evaluation of Portfolios Approaches for Solving CSPs....Pages 316-324
Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling....Pages 325-331
A Branch-and-Cut Algorithm for Solving the Team Orienteering Problem....Pages 332-339
A Lagrangian Relaxation Based Forward-Backward Improvement Heuristic for Maximising the Net Present Value of Resource-Constrained Projects....Pages 340-346
Improving Strong Branching by Propagation....Pages 347-354
Learning and Propagating Lagrangian Variable Bounds for Mixed-Integer Nonlinear Programming....Pages 355-361
Tight LP-Relaxations of Overlapping Global Cardinality Constraints....Pages 362-368
An Adaptive Model Restarts Heuristic....Pages 369-377
Constraint-Based Fitness Function for Search-Based Software Testing....Pages 378-385
Coalition Formation for Servicing Dynamic Motion Tasks....Pages 386-393
Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization....Pages 394-402
Back Matter....Pages -
....