Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems

References

• Applegate D., Cook B. A computational study of the job shop scheduling problem. Operations Research Society of America (1991) 3:149–156Google Scholar
• Balas E., Ceria S., Cornuejols G. Mixed 0-1 programming by Lift-and-Project in a Branch-and-Cut framework. Management Science (1996) 42:1229–1246Link, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsberg M. W. P., Vance P. H. Branch and price: column generation for huge integer programs. Operations Research (1998) 46:316–329Link, Google Scholar
• Bockmayr A., Kasper T. Branch-and-infer: a unifying framework for integer and finite domain constraint programming. INFORMS J. Computing (1998) 10:287–300Link, Google Scholar
• Carlier J., Pinson E. An algorithm for solving the job-shop problem. Management Science (1989) 35:164–176Link, Google Scholar
• Caseau Y., Laburthe F., Van Hentenryck P. Improving CLP scheduling with task intervals. Logic Programming: Proceedings of the 11th International Conference (1994) (MIT Press, Cambridge, MA) 369–383Google Scholar
• Caseau Y., Laburthe F., Maher M. Cumulative scheduling with task intervals. Logic Programming: Proceedings of the 1996 Joint International Conference and Symposium (1996) (MIT Press, Cambridge, MA) 363–377Google Scholar
• Chandru V., Hooker J.Optimization Methods for Logical Inference (1999) (John Wiley & Sons Inc., New York) Crossref, Google Scholar
• Colmerauer A. Prolog in 10 figures. Communications of the ACM (1985) 28:1296–1310Crossref, Google Scholar
• Darby-Dowman K., Little J. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS J. Computing (1998) 10:276–286Link, Google Scholar
• Darby-Dowman K., Little J., Mitra G., Zaffalon M. Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints, An International Journal (1997) 1:245–264Crossref, Google Scholar
• Dincbas M., Van Hentenryck P., Simonis H., Aggoun A., Graf T., Berthier F. The constraint logic programming language CHIP. FGCS-88: Proceedings of International Conference on Fifth Generation Computer Systems (1988) (Tokyo, Japan)693–702Google Scholar
• Geoffrion A. M. Generalized Benders decomposition. Journal of Optimization Theory and Applications (1972) 10:237–260Crossref, Google Scholar
• Harjunkoski I., Jain V., Grossmann I. E. Hybrid mixed-integer/constraint logic programming strategies for solving scheduling and combinatorial optimization problems. Comp. Chem. Engng. (2000) 24:337–343Crossref, Google Scholar
• Heipcke S. An example of integrating constraint programming and mathematical programming. Electronic Notes in Discrete Mathematics (1999a) 1Crossref, Google Scholar
• Heipcke S. Comparing constraint programming and mathematical programming approaches to discrete optimisation-the change problem. J. of Operational Research Society (1999b) 50:581–595Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (John Wiley & Sons Inc., New York) Crossref, Google Scholar
• Hooker J. N., Osorio M. A. Mixed logic/linear programming. Discrete Applied Mathematics (1999) 96–97:395–442Crossref, Google Scholar
• Hooker J. N., Ottosson G., Thorsteinsson E. S., Kim H. J.On integrating constraint propagation and linear programming for combinatorial optimization (1999) Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99)(AAAI, The AAAI Press/MIT Press, Cambridge, MA) 136–141Google Scholar
• ILOG, Inc.CPLEX 6.5 User's Manual (1999a) (ILOG, Inc., Incline Village, NV) Google Scholar
• ILOG, Inc.OPL Studio 2.1 User's Manual (1999b) (ILOG, Inc., Incline Village, NV) Google Scholar
• ILOG, Inc.Scheduler 4.4 User's Manual (1999c) (ILOG, Inc., Incline Village, NV) Google Scholar
• ILOG, Inc.Solver 4.4 User's Manual (1999d) (ILOG, Inc., Incline Village, NV) Google Scholar
• Le Pape C. Implementation of resource constraints in ILOG schedule: a library for the development of constraint-based scheduling systems. Intelligent Systems Engineering (1994) 3:55–66Crossref, Google Scholar
• Marriott K., Stuckey P. J.Programming with Constraints (1998) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (John Wiley and Sons, Inc., New York) Crossref, Google Scholar
• Ottosson G., Thorsteinsson E. S., Hooker J. N. Mixed global constraints and inference in hybrid CLP-IP solvers. Annals of Mathematics and Artificial Intelligence (2001) . ForthcomingGoogle Scholar
• Padberg M. W., Rinaldi G. A branch-and-cut algorithm for a symmetric travelling salesman polytope. SIAM Review (1991) 33:60–100Crossref, Google Scholar
• Proll L., Smith B. Integer linear programming and constraint logic programming approaches to a template design problem. INFORMS J. Computing (1998) 10:265–275Link, Google Scholar
• Quesada I., Grossmann I. E. An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems. Computers Chem. Engng. (1992) 19:937–947Crossref, Google Scholar
• Raman R., Grossmann I. E. Symbolic integration of logic in MILP branch and bound techniques for the synthesis of process networks. Annals of Operations Research (1993) 42:169–191Crossref, Google Scholar
• Raman R., Grossmann I. E. Modelling and computational techniques for logic based integer programming. Computers Chem. Engng. (1994) 18:563–578Crossref, Google Scholar
• Rodosek R., Wallace M. G., Hajian M. T. A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operational Research (1999) 86:63–87Crossref, Google Scholar
• Smith B. M., Brailsford S. C., Hubbard P. M., Williams H. P. The progressive party problem: integer linear programming and constraint programming compared. Constraints, An International Journal (1997) 1:119–138Crossref, Google Scholar
• Tsang E. P. K.Foundations of Constraint Satisfaction (1993) (Academic Press, Inc., San Diego, CA) Google Scholar
• Van Hentenryck P.Constraint Satisfaction in Logic Programming (1989) (MIT Press, Cambridge, MA) Google Scholar
• Van Hentenryck P.The OPL Optimization Programming Language (1999) (MIT Press, Cambridge, MA) Google Scholar
• Wallace M., Novello S., Schimpf J. ECLiPSe: a platform for constraint logic programming. ICL Systems Journal (1997) 12:159–200Google Scholar