Constraint programming

[1]  E. Balas.  DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[2]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[3]  Alan K. Mackworth.  On Reading Sketch Maps , 1977, IJCAI.

[4]  Jean-Louis Laurière,et al.  A Language and a Program for Stating and Solving Combinatorial Problems , 1978, Artif. Intell..

[5]  Eugene C. Freuder.  A sufficient condition for backtrack-bounded search , 1985, JACM.

[6]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[7]  Joxan Jaffar,et al.  Constraint logic programming , 1987, POPL '87.

[8]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[9]  Roger Mohr,et al.  Good Old Discrete Relaxation , 1988, ECAI.

[10]  Vijay A. Saraswat,et al.  Concurrent constraint programming , 1989, POPL '90.

[11]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[12]  Nicholas Beaumont,et al.  An algorithm for disjunctive programs , 1990 .

[13]  Eric Pinson,et al.  A Practical Use of Jackson''s Preemptive Schedule for Solving the Job-Shop Problem. Annals of Opera , 1991 .

[14]  R. Raman,et al.  RELATION BETWEEN MILP MODELLING AND LOGICAL INFERENCE FOR CHEMICAL PROCESS SYNTHESIS , 1991 .

[15]  Nicolas Beldiceanu,et al.  Extending CHIP in order to solve complex scheduling and placement problems , 1993, JFPL.

[16]  Pascal Van Hentenryck,et al.  A Generic Arc-Consistency Algorithm and its Specializations , 1992, Artif. Intell..

[17]  Christophe Lecoutre.  Constraint Networks , 1992 .

[18]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[19]  Ignacio E. Grossmann,et al.  Symbolic integration of logic in mixed-integer linear programming techniques for process synthesis , 1993 .

[20]  Jean-Charles Régin,et al.  A Filtering Algorithm for Constraints of Difference in CSPs , 1994, AAAI.

[21]  Jonathan Cagan,et al.  A conceptual framework for combining artificial intelligence and optimization in engineering design , 1997 .

[22]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[23]  R. Raman,et al.  Modelling and computational techniques for logic based integer programming , 1994 .

[24]  Hong Yan,et al.  Logic cuts for processing networks with fixed charges , 1994, Comput. Oper. Res..

[25]  Pascal Van Hentenryck,et al.  Design, Implementation, and Evaluation of the Constraint Language cc(FD) , 1994, Constraint Programming.

[26]  Nicolas Beldiceanu,et al.  Introducing global constraints in CHIP , 1994 .

[27]  Eugene C. Freuder,et al.  Contradicting Conventional Wisdom in Constraint Satisfaction , 1994, ECAI.

[28]  John N. Hooker,et al.  Logic-Based Methods for Optimization , 1994, PPCP.

[29]  Sally C. Brailsford,et al.  The Progressive Party Problem: Integer Linear Programming and Constraint Programming Compared , 1995, CP.

[30]  Matthew L. Ginsberg,et al.  Limited Discrepancy Search , 1995, IJCAI.

[31]  Pascal Van Hentenryck,et al.  Principles and practice of constraint programming: The Newport papers , 1996, Computers & Mathematics with Applications.

[32]  I. Grossmann,et al.  Logic-based MINLP algorithms for the optimal synthesis of process networks , 1996 .

[33]  Toby Walsh,et al.  An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem , 1996, CP.

[34]  Gert Smolka,et al.  The Oz Programming Model , 1996, Computer Science Today.

[35]  Jean-Charles Régin,et al.  Generalized Arc Consistency for Global Cardinality Constraint , 1996, AAAI/IAAI, Vol. 1.

[36]  Christian Bessiere,et al.  MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems , 1996, CP.

[37]  Ignacio E. Grossmann,et al.  A logic-based approach to scheduling problems with resource constraints , 1997 .

[38]  Philippe Baptiste,et al.  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems , 1997, CP.

[39]  François Laburthe,et al.  Solving Small TSPs with Constraints , 1997, ICLP.

[40]  Joachim Schimpf,et al.  ECLiPSe: A Platform for Constraint Logic Programming , 1997 .

[41]  Pedro Meseguer.  Interleaved Depth-First Search , 1997, IJCAI.

[42]  Eugene C. Freuder,et al.  Understanding and Improving the MAC Algorithm , 1997, CP.

[43]  Jean-francois Puget,et al.  A C++ implementation of CLP , 1997 .

[44]  Christian Bessiere,et al.  Arc Consistency for General Constraint Networks: Preliminary Results , 1997, IJCAI.

[45]  Toby Walsh.  Depth-bounded Discrepancy Search , 1997, IJCAI.

[46]  Susanne Heipcke,et al.  Integrating Constraint Programming Techniques into Mathematical Programming , 1998, ECAI.

[47]  Alexander Bockmayr,et al.  Modelling discrete optimisation problems inconstraint logic programming , 1998, Ann. Oper. Res..

[48]  Mark Wallace,et al.  Minimal Perturbance in Dynamic Scheduling , 1998, ECAI.

[49]  Alexander Bockmayr,et al.  Branch and Infer: A Unifying Framework for Integer and Finite Domain Constraint Programming , 1998, INFORMS J. Comput..

[50]  Ken Darby-Dowman,et al.  Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming , 1998, INFORMS J. Comput..

[51]  Patrick Prosser,et al.  The Dynamics of Dynamic Variable Ordering Heuristics , 1998, CP.

[52]  Pascal Van Hentenryck,et al.  Newton - Constraint Programming over Nonlinear Constraints , 1998, Sci. Comput. Program..

[53]  Ariane Partouche.  Planification d'horaires de travail : méthodologie, modélisation et résolution à l'aide de la programmation linéaire en nombres entiers et de la programmation par contraintes , 1998 .

[54]  Mark Wallace,et al.  A Generic Model and Hybrid Algorithm for Hoist Scheduling Problems , 1998, CP.

[55]  Evelina Lamma,et al.  Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem , 1998 .

[56]  Jean-François Puget,et al.  A Fast Algorithm for the Bound Consistency of alldiff Constraints , 1998, AAAI/IAAI.

[57]  Toby Walsh,et al.  Interleaved and Discrepancy Based Search , 1998, ECAI.

[58]  Jean-Charles Régin,et al.  Arc Consistency for Global Cardinality Constraints with Costs , 1999, CP.

[59]  Mark Wallace,et al.  A new approach to integrating mixed integer programming and constraint logicprogramming , 1999, Ann. Oper. Res..

[60]  Danny De Schreye.  Solving TSP with Time Windows with Constraints , 1999 .

[61]  María Auxilio Osorio Lama,et al.  Mixed Logical-linear Programming , 1999, Discret. Appl. Math..

[62]  Philippe Refalo.  Tight Cooperation and Its Application in Piecewise Linear Optimization , 1999, CP.

[63]  Pascal Van Hentenryck,et al.  Constraint Programming in OPL , 1999, PPDP.

[64]  Eric Bourreau,et al.  Traitement de contraintes sur les graphes en programmation par contraintes , 1999 .

[65]  Toby Walsh,et al.  The Difference All-Difference Makes , 1999, IJCAI.

[66]  Pascal Van Hentenryck.  The OPL optimization programming language , 1999 .

[67]  Christian Bessiere,et al.  Non-Binary Constraints , 1999, CP.

[68]  Andrea Lodi,et al.  Cost-Based Domain Filtering , 1999, CP.

[69]  Stefan E. Karisch,et al.  A Framework for Constraint Programming Based Column Generation , 1999, CP.

[70]  John N. Hooker,et al.  On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization , 1999, AAAI/IAAI.

[71]  Hong Yan,et al.  Tight representation of logical constraints as cardinality rules , 1999, Math. Program..

[72]  Jean-Charles Régin.  The Symmetric Alldiff Constraint , 1999, IJCAI.

[73]  Christian Bessiere,et al.  Using Constraint Metaknowledge to Reduce Arc Consistency Computation , 1999, Artif. Intell..

[74]  Toby Walsh,et al.  Encodings of Non-Binary Constraint Satisfaction Problems , 1999, AAAI/IAAI.

[75]  Nicolas Beldiceanu,et al.  Global Constraints as Graph Properties on a Structured Network of Elementary Constraints of the Same Type , 2000, CP.

[76]  Qi Zhang Liu,et al.  Collaborative Model and Algorithms for Supporting Real-Time Distribution Logistics Systems , 2000, Electron. Notes Discret. Math..

[77]  Kurt Mehlhorn,et al.  Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint , 2000, CP.

[78]  Jianyang Zhou,et al.  Introduction to the constraint language NCL , 2000, J. Log. Program..

[79]  Roland H. C. Yap,et al.  Arc Consistency on n-ary Monotonic and Linear Constraints , 2000, CP.

[80]  Philippe Refalo,et al.  Linear Formulation of Constraint Programming Models and Hybrid Solvers , 2000, CP.

[81]  Fahiem Bacchus,et al.  Extending Forward Checking , 2000, CP.

[82]  J. Hooker,et al.  Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction , 2000 .

[83]  Mats Carlsson,et al.  Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint , 2001, CP.

[84]  Alexander Bockmayr,et al.  Solving Assembly Line Balancing Problems by Combining IP and CP , 2001, ArXiv.

[85]  François Laburthe,et al.  Learning Hybrid Algorithms for Vehicle Routing Problems , 2004, Theory Pract. Log. Program..

[86]  Alexander Bockmayr,et al.  Network Flow Problems in Constraint Programming , 2001, CP.

[87]  Nicolas Beldiceanu.  Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family , 2001, CP.

[88]  Meinolf Sellmann,et al.  Cp-based lagrangian relaxation for a multimedia application , 2001 .

[89]  M. Wallace,et al.  Hybrid Benders Decomposition Algorithms in Constraint Logic Programming , 2001, CP.

[90]  Roland H. C. Yap,et al.  Making AC-3 an Optimal Algorithm , 2001, IJCAI.

[91]  Peter van Beek,et al.  Conflict-Directed Backjumping Revisited , 2011, J. Artif. Intell. Res..

[92]  Erlendur S. Thorsteinsson.  Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming , 2001, CP.

[93]  Christian Bessiere,et al.  Domain Filtering Consistencies , 2011, J. Artif. Intell. Res..

[94]  Patrice Boizumault,et al.  Resource Allocation In ATM Networks: A Hybrid Approach , 2001 .

[95]  Irvin J. Lustig,et al.  Constraint Programming and Its Relationship to Mathematical Programming , 2001 .

[96]  Willem Jan van Hoeve,et al.  The alldifferent Constraint: A Survey , 2001, ArXiv.

[97]  Hong Yan,et al.  Representations of the all_different Predicate of Constraint Satisfaction in Integer Programming , 2001, INFORMS J. Comput..

[98]  Philippe Baptiste,et al.  Constraint-based scheduling , 2001 .

[99]  Gerhard J. Woeginger,et al.  The reconstruction of polyominoes from their orthogonal projections , 2001, Inf. Process. Lett..

[100]  T. Benoist,et al.  Lagrange Relaxation and Constraint Programming Collaborative schemes for Traveling Tournament Problems , 2001 .

[101]  Christian Bessire.  Refining the Basic Constraint Propagation Algorithm 1 , 2001 .

[102]  Vipul Jain,et al.  Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems , 2001, INFORMS J. Comput..

[103]  Qi Guo,et al.  Non-overlapping Constraints between Convex Polytopes , 2001, CP.

[104]  Toby Walsh,et al.  Binary vs. non-binary constraints , 2002, Artif. Intell..

[105]  John N. Hooker,et al.  Logic, Optimization, and Constraint Programming , 2002, INFORMS J. Comput..

[106]  Erlendur S. Thorsteinsson,et al.  Linear Relaxations and Reduced-Cost Based Propagation of Continuous Variable Subscripts , 2002, Ann. Oper. Res..

[107]  John N. Hooker.  A Framework for Integrating Solution Methods , 2003 .

[108]  J. Christopher Beck,et al.  A Hybrid Approach to Scheduling with Earliness and Tardiness Costs , 2003, Ann. Oper. Res..

[109]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[110]  Philippe Baptiste,et al.  Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems , 1997, Constraints.

[111]  Sally C. Brailsford,et al.  The progressive party problem: Integer linear programming and constraint programming compared , 1995, Constraints.

[112]  Egon Balas,et al.  On unions and dominants of polytopes , 2004, Math. Program..

[113]  Noëlle Bleuzen-Guernalec,et al.  Optimal Narrowing of a Block of Sortings in Optimal Time , 2004, Constraints.

[114]  François Laburthe,et al.  SALSA: A Language for Search Algorithms , 1998, Constraints.

[115]  John N. Hooker,et al.  Mixed Global Constraints and Inference in Hybrid CLP–IP Solvers , 2002, Annals of Mathematics and Artificial Intelligence.

[116]  Gautam Mitra,et al.  Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem , 1997, Constraints.