An integrated solver for optimization problems

Operations Research

Volumn 58, Issue 2, 2010, Pages 342-356

  Yunes, Tallys ^a   Aron, Ionuţ D ^b   Hooker, J N ^c  

^a UNIVERSITY OF MIAMI   (United States)

^b WorldQuant LLC   (United States)

^c CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Constraint; modeling languages; Global; Integer; Integrated optimization; Nonlinear; Optimization; Production: planning and product configuration; Programming: linear; Scheduling: parallel machines

Indexed keywords

INTEGER; INTEGRATED OPTIMIZATION; MODELING LANGUAGES; NON-LINEAR OPTIMIZATION; PARALLEL MACHINE; PRODUCT CONFIGURATION; PROGRAMMING: LINEAR;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; GLOBAL OPTIMIZATION; HIGH LEVEL LANGUAGES; LINEAR PROGRAMMING; LINEARIZATION; LINGUISTICS; MACHINE DESIGN; MACHINERY; OPTIMIZATION; PROBLEM SOLVING; PRODUCTION CONTROL; QUERY LANGUAGES; SCHEDULING;

INTEGER PROGRAMMING;

EID: 77951159335     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1090.0733     Document Type: Article

References (60)

1. Achterberg, T., T. Berthold, T. Koch, K. Wolter. 2008. Constraint integer programming: A new approach to integrate CP and MIP. L. Perron, M. A. Trick, eds. Conf. Integration AI and OR Techniques in Constraint Programming Combin. Optim. Problems (CPAIOR 2008). Lecture Notes in Computer Science, Vol.5015. Springer, Berlin, 6-20.
2. Ajili, F., M. Wallace. 2003. Hybrid problem solving in ECLiPSe. M. Milano, ed. Constraint and Integer Programming: Toward a Unified Methodology. Kluwer, Norwell, MA, 169-201.
3. Aron, I., J. N. Hooker, T. H. Yunes. 2004. SIMPL: A system for integrating optimization techniques. J.-C. Régin, M. Rueher, eds. Conf. Integration AI and OR Techniques in Constraint Programming Combin. Optim. Problems (CPAIOR 2004). Lecture Notes in Computer Science, Vol.3011. Springer, Berlin, 21-36.
4. Balas, E., S. Ceria, G. Cornuéjols. 1993. A lift-and-project cutting plane algorithm for mixed 0-1 programs. Math. Programming 58 295-324.
5. Baptiste, P., C. Le Pape, W. Nuijten. 2001. Constraint-Based Scheduling-Applying Constraint Programming to Scheduling Problems. Kluwer, Norwell, MA.
6. Beck, C., P. Refalo. 2003. A hybrid approach to scheduling with earliness and tardiness costs. Ann. Oper. Res. 118 49-71.
7. Benoist, T., E. Gaudin, B. Rottembourg. 2002. Constraint programming contribution to Benders decomposition: A case study. P. van Hentenryck, ed. Principles and Practice of Constraint Programming (CP 2002). Lecture Notes in Computer Science, Vol.2470. Springer, Berlin, 603-617.
8. Bockmayr, A., T. Kasper. 1998. Branch and infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Comput. 10 287-300.
9. Bockmayr, A., N. Pisaruk. 2003. Detecting infeasibility and generating cuts for MIP using CP. 5th Internat. Workshop Integration AI and OR Techniques in Constraint Programming Combin. Optim. Problems (CPAIOR 2003), Montréal, Quebec, Canada.
10. Bollapragada, S., O. Ghattas, J. N. Hooker. 2001. Optimal design of truss structures by mixed logical and linear programming. Oper. Res. 49 42-51.
11. Brooke, A., D. Kendrick, A. Meeraus. 1988. GAMS: A User's Guide. The Scientific Press, Redwood City, CA.
12. Cheadle, A. M., W. Harvey, A. J. Sadler, J. Schimpf, K. Shen, M. G. Wallace. 2003. ECLiPSe : An introduction. Technical Report IC-Parc-03-1, IC-Parc, Imperial College, London.
13. Colombani, Y., S. Heipcke. 2002. Mosel: An extensible environment for modeling and programming solutions. Internat. Workshop Integration AI and OR Techniques in Constraint Programming Combin. Optim. Problems (CPAIOR 2002), Le Croisic, France.
14. Colombani, Y., S. Heipcke. 2004. Mosel: An overview. White paper, Dash Optimization, Ltd., Blisworth, UK.
15. Dincbas, M., P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, F. Berthier. 1988. The constraint logic programming language CHIP. Proc. Internat. Conf. Fifth Generation Comput. Systems, Tokyo, 693-702.
16. Easton, K., G. Nemhauser, M. Trick. 2002. Solving the traveling tournament problem: A combined integer programming and constraint programming approach. Proc. Internat. Conf. Practice and Theory Automated Timetabling (PATAT 2002), Ghent, Belgium.
17. Floudas, C., P. Pardalos, C. Adjiman, W. Esposito, Z. Gümüs, S. Harding, J. Klepeis, C. Meyer, C. Schweiger. 1999. Handbook of Test Problems in Local and Global Optimization, NonconvexOptimization and Its Applications, Vol.33. Kluwer, Dordrecht, The Netherlands.
18. Focacci, F., A. Lodi, M. Milano. 1999. Cost-based domain filtering. J. Jaffar, ed. Principles and Practice of Constraint Programming (CP). Lecture Notes in Computer Science, Vol.1713. Springer, Berlin, 189-203.
19. Fourer, R., D. M. Gay, B. W. Kernighan. 2003. AMPL-A Modeling Language for Mathematical Programming. Thomson Learning.
20. Ghattas, O., I. Grossman. 1991. MINLP and MILP strategies for discrete sizing structural optimization problems. Proc. ASCE 10th Conf. Electronic Comput., Indianapolis, 197-204.
21. Guéret, C., C. Prins, M. Sevaux, S. Heipcke. 2002. Applications of Optimization with XPRESS-MP. Dash Optimization Ltd., Blisworth, UK.
22. Hajian, M. T., H. El-Sakkout, M. Wallace, J. M. Lever, E. B. Richards. 1996. Toward a closer integration of finite domain propagation and simplex-based algorithms. Proc. Fourth Internat. Sympos. Artificial Intelligence and Math., Fort Lauderdale, FL.
23. Hooker, J. N. 1994. Logic-based methods for optimization. A. Borning, ed. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, Vol.874. Springer, Berlin, 336-349.
24. Hooker, J. N. 1996. Inference duality as a basis for sensitivity analysis. E. C. Freuder, ed. Principles and Practice of Constraint Programming (CP). Lecture Notes in Computer Science, Vol.1118. Springer, Berlin, 224-236.
25. Hooker, J. N. 1997. Constraint satisfaction methods for generating valid cuts. D. L. Woodruff, ed. Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search. Kluwer, Dordrecht, The Netherlands, 1-30.
26. Hooker, J. N. 1999. Inference duality as a basis for sensitivity analysis. Constraints 4 104-112.
27. Hooker, J. N. 2000. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. John Wiley & Sons, New York.
28. Hooker, J. N. 2002. Logic, optimization and constraint programming. INFORMS J. Comput. 14 295-321.
29. Hooker, J. N. 2003. A framework for integrating solution methods. H. K. Bhargava, M. Ye, eds. Computational Modeling and Problem Solving in the Networked World (Proc. ICS2003). Kluwer, 3-30.
30. Hooker, J. N. 2004. A hybrid method for planning and scheduling. M. Wallace, ed. Principles and Practice of Constraint Programming (CP 2004). Lecture Notes in Computer Science, Vol.3258. Springer, Berlin, 305-316.
31. Hooker, J. N. 2005a. A search-infer-and-relax framework for integrating solution methods. R. Barták, M. Milano, eds. Conf. Integration AI and OR Techniques in Constraint Programming Combin. Optim. Problems (CPAIOR 2005). Lecture Notes in Computer Science, Vol.3709. Springer, Berlin, 314-327.
32. Hooker, J. N. 2005b. A hybrid method for planning and scheduling. Constraints 10 385-401.
33. Hooker, J. N. 2005c. Convex programming methods for global optimization. C. Jermann, A. Neumaier, D. Sam, eds. Global Optimization and Constraint Satisfaction (COCOS 2003). Lecture Notes in Computer Science, Vol.3478. Springer, Berlin, 46-60.
34. Hooker, J. N. 2006. Operations research methods in constraint programming. F. Rossi, P. van Beek, T. Walsh, eds. Handbook of Constraint Programming. Elsevier, Amsterdam, 525-568.
35. Hooker, J. N. 2007. Integrated Methods for Optimization. Springer, New York.
36. Hooker, J. N., M. A. Osorio. 1999. Mixed logical/linear programming. Discrete Appl. Math. 96-97 395-442.
37. Hooker, J. N., H. Yan. 1995. Logic circuit verification by Benders decomposition. V. Saraswat, P. Van Hentenryck, eds. Principles and Practice of Constraint Programming: The Newport Papers. MIT Press, 267-288.
38. Hooker, J. N., G. Ottosson, E. S. Thorsteinsson, H.-J. Kim. 2000. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engrg. Rev. 15 11-30.
39. ILOG, S. A. 2003. ILOG Solver 6.0 User's Manual. ILOG, Gentilly, France.
40. ILOG, S. A. 2007. ILOG CPLEX 11.0 User's Manual. ILOG, Gentilly, France.
41. Jain, V., I. E. Grossmann. 2001. Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13 258-276.
42. Junker, U., S. E. Karisch, N. Kohl, B. Vaaben, T. Fahle, M. Sellmann. 1999. A framework for constraint programming based column generation. J. Jaffar, ed. Principles and Practice of Constraint Programming (CP). Lecture Notes in Computer Science, Vol.1713. Springer, Berlin, 261-274.
43. Milano, M. 2003. Constraint and Integer Programming: Toward a Unified Methodology. Kluwer, Norwell, MA.
44. Ottosson, G., E. Thorsteinsson, J. N. Hooker. 1999. Mixed global constraints and inference in hybrid IP-CLP solvers. CP99 Post-Conf. Workshop Large-Scale Combin. Optim. Constraints, Alexandria, VA, 57-78. http://www.dash.co.uk/wscp99.
45. Ottosson, G., E. S. Thorsteinsson, J. N. Hooker. 2002. Mixed global constraints and inference in hybrid CLP-IP solvers. Ann. Math. Artificial Intelligence 34 271-290.
46. Pintér, J. D. 2005. LGO-A model development system for continuous global optimization. User's Guide. Pintér Consulting Services, Inc., Halifax, Nova Scotia, Canada.
47. Rasmussen, R., M. Trick. 2005. A Benders approach for the minimum break scheduling problem. INFORMS 2005, San Francisco. INFORMS, Hanover, MD.
48. Refalo, P. 1999. Tight cooperation and its application in piecewise linear optimization. J. Jaffar, ed. Principles and Practice of Constraint Programming (CP 1999). Lecture Notes in Computer Science, Vol.1713. Springer, Berlin, 375-389.
49. Rodošek, R., M. Wallace, M. T. Hajian. 1999. A new approach to integrating mixed integer programming and constraint logic programming. Ann. Oper. Res. 86 63-87.
50. Sellmann, M., T. Fahle. 2001. Constraint programming based Lagrangian relaxation for a multimedia application. Third Internat. Workshop Integration AI and OR Techniques (CPAIOR), London.
51. Tawarmalani, M., N. V. Sahinidis. 2004. Global optimization of mixedinteger nonlinear programs: A theoretical and computational study. Math. Programming 99(3) 563-591.
52. Thorsteinsson, E. S. 2001. Branch-and-check: A hybrid framework integrating mixed integer programming and constraint logic programming. T. Walsh, ed. Principles and Practice of Constraint Programming (CP 2001). Lecture Notes in Computer Science, Vol.2239. Springer, Berlin, 16-30.
53. Thorsteinsson, E. S., G. Ottosson. 2001. Linear relaxations and reducedcost based propagation of continuous variable subscripts. Ann. Oper. Res. 115 15-29.
54. Timpe, C. 2002. Solving planning and scheduling problems with combined integer and constraint programming. OR Spectrum 24 431-448.
55. Van Hentenryck, P., I. Lustig, L. Michel, J. F. Puget. 1999. The OPL Optimization Programming Language. MIT Press, Cambridge, MA.
56. Van Hoeve, W. J. 2003. A hybrid constraint programming and semidefinite programming approach for the stable set problem. F. Rossi, ed. Principles and Practice of Constraint Programming (CP 2003). Lecture Notes in Computer Science, Vol. 2833. Springer, Berlin, 407-421.
57. Williams, H. P., H. Yan. 2001. Representations of the all-different predicate of constraint satisfaction in integer programming. INFORMS J. Comput. 13(2) 96-103.
58. Yan, H., J. N. Hooker. 1999. Tight representation of logical constraints as cardinality rules. Math. Programming 85 363-377.
59. Yunes, T. H., A. V. Moura, C. C. de Souza. 1999. Exact solutions for real world crew scheduling problems. INFORMS Annual Meeting, Philadelphia. INFORMS, Hanover, MD.
60. Yunes, T. H., A. V. Moura, C. C. de Souza. 2005. Hybrid column generation approaches for urban transit crew management problems. Transportation Sci. 39(2) 273-288