Global Constraints

[1]  J. Petersen.  Die Theorie der regulären graphs , 1891 .

[2]  B. L. Waerden.  Ein Satz über Klasseneinteilungen von endlichen Mengen , .

[3]  P. Hall.  On Representatives of Subsets , 1935 .

[4]  T. Koopmans.  Activity analysis of production and allocation : proceedings of a conference , 1952 .

[5]  D. R. Fulkerson,et al.  Constructing Maximal Dynamic Flows from Static Flows , 1958 .

[6]  Robert G. Busacker,et al.  A PROCEDURE FOR DETERMINING A FAMILY OF MINIMUM-COST NETWORK FLOW PATTERNS , 1960 .

[7]  M. Iri.  A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[8]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[9]  Robert E. Tarjan,et al.  Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..

[10]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[11]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

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

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  L. G. H. Cijan.  A polynomial algorithm in linear programming , 1979 .

[15]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[16]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[17]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[18]  N. Biggs.  THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[19]  Pascal Van Hentenryck,et al.  Generality versus Specificity: An Experience with AI and OR Techniques , 1988, AAAI.

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

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

[22]  J. Carlier,et al.  Adjustment of heads and tails for the job-shop problem , 1994 .

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

[24]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

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

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

[27]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

[29]  Christian Bessiere,et al.  An Original Constraint Based Approach for Solving over Constrained Problems , 2000, CP.

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

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

[32]  Gilles Pesant,et al.  A Filtering Algorithm for the Stretch Constraint , 2001, CP.

[33]  Christian Bessiere,et al.  Specific Filtering Algorithms for Over-Constrained Problems , 2001, CP.

[34]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[35]  Michael A. Trick.  A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints , 2003, Ann. Oper. Res..

[36]  Roman Barták,et al.  Dynamic Global Constraints in Backtracking Based Environments , 2003, Ann. Oper. Res..

[37]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[38]  Meinolf Sellmann.  Approximated Consistency for Knapsack Constraints , 2003, CP.

[39]  Peter van Beek,et al.  Improved Algorithms for the Global Cardinality Constraint , 2004, CP.

[40]  Willem Jan van Hoeve,et al.  A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint , 2004, CP.

[41]  Mats Carlsson,et al.  Deriving Filtering Algorithms from Constraint Checkers , 2004, CP.

[42]  Toby Walsh,et al.  The Tractability of Global Constraints , 2004, CP.

[43]  Jean-Charles Régin,et al.  Cost-Based Arc Consistency for Global Cardinality Constraints , 2002, Constraints.

[44]  Per Kreuger,et al.  Filtering Methods for Symmetric Cardinality Constraint , 2004, CPAIOR.

[45]  Yves Caseau,et al.  A deductive and object-oriented approach to a complex scheduling problem , 2004, Journal of Intelligent Information Systems.

[46]  Franco P. Preparata,et al.  Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems , 1981, Acta Informatica.

[47]  Peter van Beek,et al.  A Domain Consistency Algorithm for the Stretch Constraint , 2004, CP.

[48]  Toby Walsh,et al.  Disjoint, Partition and Intersection Constraints for Set and Multiset Variables , 2004, CP.

[49]  Gilles Pesant,et al.  A Regular Language Membership Constraint for Finite Sequences of Variables , 2004, CP.

[50]  Mats Carlsson,et al.  Graph Invariants as Necessary Conditions for Global Constraints , 2005, CP.

[51]  Philippe Baptiste,et al.  Inter-distance Constraint: An Extension of the All-Different Constraint for Scheduling Equal Length Jobs , 2005, CP.

[52]  Toby Walsh,et al.  The Range and Roots Constraints: Specifying Counting and Occurrence Problems , 2005, IJCAI.

[53]  Yves Deville,et al.  CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.

[54]  Peter van Beek,et al.  An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint , 2005, Constraints.

[55]  Irit Katriel,et al.  Complete Bound Consistency for the Global Cardinality Constraint , 2005, Constraints.

[56]  Nicolas Beldiceanu,et al.  Global Constraint Catalog , 2005 .

[57]  Irit Katriel,et al.  Expected-Case Analysis for Delayed Filtering , 2006, CPAIOR.

[58]  Meinolf Sellmann,et al.  Cost-based Filtering for Shorter Path Constraints , 2003, Constraints.

[59]  Gilles Pesant,et al.  On global warming: Flow-based soft global constraints , 2006, J. Heuristics.

[60]  Yuval Rabani,et al.  Linear Programming , 2007, Handbook of Approximation Algorithms and Metaheuristics.

[61]  Pascal Van Hentenryck,et al.  Edge Finding for Cumulative Scheduling , 2008, INFORMS J. Comput..