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

Invited Talks.- Machine Learning Framework for Classification in Medicine and Biology.- G12 - Towards the Separation of Problem Modelling and Problem Solving.- Regular Papers.- Six Ways of Integrating Symmetries within Non-overlapping Constraints.- Throughput Constraint for Synchronous Data Flow Graphs.- A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem.- Backdoors to Combinatorial Optimization: Feasibility and Optimality.- Solution Enumeration for Projected Boolean Search Problems.- k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach.- Optimal Interdiction of Unreactive Markovian Evaders.- Using Model Counting to Find Optimal Distinguishing Tests.- Reformulating Global Grammar Constraints.- IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems.- Open Constraints in a Boundable World.- Sequencing and Counting with the multicost-regular Constraint.- Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services.- Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming.- The Polytope of Context-Free Grammar Constraints.- Determining the Number of Games Needed to Guarantee an NHL Playoff Spot.- Scalable Load Balancing in Nurse to Patient Assignment Problems.- Learning How to Propagate Using Random Probing.- DFS* and the Traveling Tournament Problem.- Max Energy Filtering Algorithm for Discrete Cumulative Resources.- Extended Abstracts.- Hybrid Branching.- Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations.- Constraint Models for Sequential Planning.- A Fast Algorithm to Solve the Frequency Assignment Problem.- A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem.- Modelling Search Strategies in Rules2CP.- CP-INSIDE: Embedding Constraint-Based Decision Engines in Business Applications.- An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays.- A Benders'Approach to a Transportation Network Design Problem.- Progress on the Progressive Party Problem.

[1]  John N. Hooker,et al.  A Constraint Store Based on Multivalued Decision Diagrams , 2007, CP.

[2]  John N. Hooker,et al.  Cost-Bounded Binary Decision Diagrams for 0-1 Programming , 2007, CPAIOR.

[3]  S. Arnborg,et al.  Characterization and recognition of partial 3-trees , 1986 .

[4]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

[5]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[6]  Derek G. Corneil,et al.  Complexity of finding embeddings in a k -tree , 1987 .

[7]  Adnan Darwiche,et al.  DPLL with a Trace: From SAT to Knowledge Compilation , 2005, IJCAI.

[8]  Russell Impagliazzo,et al.  Memoization and DPLL: formula caching proof systems , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[9]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[10]  Prakash P. Shenoy,et al.  Propagating Belief Functions with Local Computations , 1986, IEEE Expert.

[11]  Eric V. Denardo,et al.  Dynamic Programming: Models and Applications , 2003 .

[12]  André Augusto Ciré,et al.  MDD Propagation for Disjunctive Scheduling , 2012, ICAPS.

[13]  David Bergman,et al.  Manipulating MDD Relaxations for Combinatorial Optimization , 2011, CPAIOR.

[14]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[15]  R Bellman,et al.  On the Theory of Dynamic Programming. , 1952, Proceedings of the National Academy of Sciences of the United States of America.

[16]  Willem Jan van Hoeve,et al.  A Systematic Approach to MDD-Based Constraint Programming , 2010, CP.

[17]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[18]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[19]  David Bergman,et al.  Optimization Bounds from Binary Decision Diagrams , 2014, INFORMS J. Comput..

[20]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[21]  Toniann Pitassi,et al.  Solving #SAT and Bayesian Inference with Backtracking Search , 2014, J. Artif. Intell. Res..

[22]  Timothy J. Lowe,et al.  Solving Structured Multifacility Location Problems Efficiently , 1994, Transp. Sci..

[23]  Toniann Pitassi,et al.  Algorithms and complexity results for #SAT and Bayesian inference , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[24]  Bernd Becker,et al.  BDDs in a Branch and Cut Framework , 2005, WEA.

[25]  Khaled Mellouli,et al.  Propagating belief functions in qualitative Markov trees , 1987, Int. J. Approx. Reason..

[26]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Several Probabilistic Inference , 2013, ArXiv.

[27]  Warren B. Powell,et al.  Approximate Dynamic Programming - Solving the Curses of Dimensionality , 2007 .

[28]  Barry O'Sullivan,et al.  Approximate Compilation of Constraints into Multivalued Decision Diagrams , 2008, CP.

[29]  John N. Hooker,et al.  Postoptimality Analysis for Integer Programming Using Binary Decision Diagrams , 2008 .

[30]  Pierre Hansen,et al.  The basic algorithm for pseudo-Boolean programming revisited , 1988, Discret. Appl. Math..

[31]  Friedrich Eisenbrand,et al.  0/1 Vertex and Facet Enumeration with BDDs , 2007, ALENEX.

[32]  H. Andersen.  An Introduction to Binary Decision Diagrams , 1997 .

[33]  Markus Behle,et al.  Binary decision diagrams and integer programming , 2007 .