Modeling and Solving

[1]  Jianyang Zhou.  Routing by Mixed Set Programming , 2009 .

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

[3]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[4]  Jean-François Puget,et al.  Programmation logique sous contraintes en C++ , 1994, Langages et Modèles à Objets.

[5]  W. S. Andrews.  Magic Squares and Cubes , 2018 .

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

[7]  Jianyang Zhou.  A Permutation-Based Approach for Solving the Job-Shop Problem , 2004, Constraints.

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

[9]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[10]  Ian Gambini.  A Method for Cutting Squares into Distinct Squares , 1999, Discret. Appl. Math..

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

[12]  J. K. Lenstra,et al.  Computational complexity of discrete optimization problems , 1977 .

[13]  Warwick Harvey,et al.  Solving the MOLR and Social Golfers Problems , 2005, CP.

[14]  Ingo Wegener,et al.  Solution of the knight's Hamiltonian path problem on chessboards , 1994, Discret. Appl. Math..

[15]  C. J. Bouwkamp,et al.  Catalogue of simple perfect squared squares of orders 21 through 25 , 1992 .

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

[17]  Krzysztof R. Apt,et al.  Constraint logic programming using Eclipse , 2007 .

[18]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[19]  Claude Kirchner,et al.  Generating Feasible Schedules for a Pick-up and Delivery Problem , 1998, Electron. Notes Discret. Math..

[20]  Andrew Lim,et al.  A metaheuristic for the pickup and delivery problem with time windows , 2001, Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001.

[21]  J. Carlier,et al.  An algorithm for solving the job-shop problem , 1989 .

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

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

[24]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[25]  Panos M. Pardalos,et al.  A Collection of Test Problems for Constrained Global Optimization Algorithms , 1990, Lecture Notes in Computer Science.

[26]  Gert Smolka.  The Oz Programming Model , 1996 .

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

[28]  Grady Booch,et al.  Object-Oriented Analysis and Design with Applications , 1990 .