Abstract
This chapter presents the methodology of modeling and solving using NCL.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Mathl. Comput. Modelling, 17(7), 57–73 (1993)
Andrews, W.S.: Magic Squares and Cubes. New York: Dover (1960)
Applegate, D., Cook, W.: A computational study of the job shop scheduling problem. Operations Research Society of America, 3(2): 149–156 (1991)
Apt, K.R., Wallace, M.: Constraint Logic Programming using Eclipse. Cambridge University Press (2007)
Bleuzen-Guernalec, N., Colmerauer, A.: Optimal narrowing of a block of sortings in optimal time. Constraints 5(1/2): 85–118 (2000)
Booch, G.: Object-Oriented Analysis and Design with Applications. Addison-Wesley (2007)
Bouwkamp, C.J., Duijvestijn, A.J.W.: Catalogue of simple perfect squared squares of orders 21 through 25. Eindhoven University of Technology, Technical Report 92 WSK 03, the Netherlands (1992)
Carlier, J., Pinson, E.: An algorithm for solving the job shop problem. Management Science, 35(2): 164–176 (1989)
Colmerauer, A.: PROLOG II reference manual and theoretical model. Technical report, Groupe Intelligence Articielle, Université Aix-Marseille II (1982)
Colmerauer, A.: An introduction to Prolog III. Communications of the ACM, 33(7): 69–90 (1990)
Colmerauer, A.: Prolog IV Specifications. Reference Manual WP7/R25, Esprit project 5246, TRD Prince (1995)
Conrad, A., Hindricks, T., Morsy, H., Wegener, I.: Solution of the knight’s Hamiltonian path problem on chessboards. Discrete Applied Mathematics, 50: 125–134 (1994)
Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The constraint logic language CHIP. Proc. of the 3rd Annual ACM Symposium on Theory of Computing, 151–158 (1988)
Domenjoud, E., Kirchner, C., Zhou, J.: Generating feasible schedules for a pick-up and delivery problem. Electronic Notes in Discrete Mathematics 1: 36–47 (1999)
Dudeney, H.: In Strand Magazine. Vol. 68, pp. 97 and 214 (1924)
Faure, R.: Le déchargement et le chargement d’un navire. Exercises et problème résolus de recherche opérationnelle, Masson, T3: 279–282 (1991)
Floudas, C.A., Pardalos, P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms. New York: Springer (1990)
Gambini, I.: A method for cutting squares into distinct squares. Discrete Applied Mathematics, 98(1–2): 65–80 (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman (1979)
Hall, P.: On representatives of subsets. J. London Math. Soc., 10(37): 26–30 (1935)
Harvey, W., Winterer, T.: Solving the MOLR and social golfers problems. CP’05: 286–300 (2005)
Hoffman, K.L., Padberg, M.: Solving airline crew scheduling problems by branch-and-cut. Management Science, 39(6): 657–682 (1993)
Jaffar, J., Lassez, J.L.: Constraint Logic Programming. Proc. of the 14th ACM POPL Conference, Munich, 111–119 (1987)
Lenstra, J.K., Rinnooy Kan, A.H.G.: Computational complexity of discrete optimization problems. Annals of Discrete Mathematics, 4: 121–140 (1979)
Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. Proc. of IEEE International Conference on Tools with Artificial Intelligence, 13: 160–167 (2001)
Muth, J.F., Thompson, G.L.: Industrial Scheduling. Englewood Cliffs, NJ: Prentice-Hall (1963)
Puget, J.-F.: Programmation logique sous contraintes en C++. LMO 1994: 193–202 (1994)
Régin, J.C.: A filtering algorithm for constraints of difference in CSPs. Proc. of AAAI, 1: 362–367 (1994)
Régin, J.C.: Generalized arc consistency for global cardinality constraint. AAAI/IAAI, 1: 209–215 (1996)
Smith, B., Brailsford, S., Hubbard, P.M., Williams, H.B.: The progressive party problem: Integer linear programming and constraint programming compared. Constraints, 1–2: 119–138 (1996)
Smith, D.: So you thought Sudoku came from the Land of the Rising Sun ….The Observer, Sunday, 15 May, 2005 (2005)
Smolka, G.: The Oz programming model. Computer Science Today, 324–343 (1995)
Solomon, M.M.: The vehicle routing and scheduling problems with time window constraints. Operations Research, 35: 254–265 (1987)
Stewart, I.: Calculs d’enfer. Vision Mathématique, 86–88 (1994)
Zhou, J.: A permutation-based approach for solving the Job-shop problem. Constraints, 2(2): 185–213 (1997)
Zhou, J.: Routing by mixed set programming. Proc. of the 8th International Symposium on Operations Research and Its Applications, 157–166 (2009)
Rights and permissions
Copyright information
© 2012 Science Press
About this chapter
Cite this chapter
Zhou, J. (2012). Modeling and Solving. In: The NCL Natural Constraint Language. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23845-1_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-23845-1_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23844-4
Online ISBN: 978-3-642-23845-1
eBook Packages: Computer ScienceComputer Science (R0)