An unconstrained quadratic binary programming approach to the vertex coloring problem

Annals of Operations Research

Volumn 139, Issue 1, 2005, Pages 229-241

  Kochenberger, Gary A ^a   Glover, Fred ^b   Alidaee, Bahram ^c   Rego, Cesar ^c  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF COLORADO   (United States)

^c UNIVERSITY OF MISSISSIPPI   (United States)

Author keywords

Combinatorial optimization; Graph coloring; Tabu search

Indexed keywords

EID: 25444490347     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1007/s10479-005-3449-7     Document Type: Article

References (162)

1. Alidaee, B., G. Kochenberger, and A. Ahmadian. (1994). "0-1 Quadratic Programming Approach for the Optimal Solution of Two Scheduling Problems." International. Journal of Systems Science 25, 401-408.
2. Alkhamis, T.M., M. Hasan, and M.A. Ahmed. (1998). "Simulated Annealing for the Unconstrained Binary Quadratic Pseudo-Boolean Function." European Journal of Operational Research 108, 641-652.
3. Amini, M., B. Alidaee, and G. Kochenberger. (1999)."A Scatter Search Approach to Unconstrained Quadratic Binary Programs." In Corne, Dorigo and Glover (eds.), New Methods in Optimization, McGraw-Hill, pp. 317-330.
4. Beasley, J.E. (1999). "Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem." Working Paper, Imperial College.
5. Billionet, A. and A. Sutter. (1994). "Minimization of a Quadratic Pseudo-Boolean Function." European Journal of OR 78, 106-115.
6. Boros, E. and P. Hammer. (2002). "Pseudo-Boolean Optimization." Discrete Applied Mathematics 123(1-3), 155-225.
7. Boros, E., P. Hammer, and X. Sun. (1989). "The DDT Method for Quadratic 0-1 Minimization." RUTCOR Research Center, RRR 39-89.
8. Boros, E. and A. Prekopa. (1989). "Probabilistic Bounds and Algorithms for the Maximum Satisfiability Problem." Annals of OR 21, 109-126.
9. Bouijolly, J.M., P. Gill, G. Laporte and H. Mercure. (1994). "A Quadratic 0/1 Optimization Algorithm for the Maximum Clique and Stable Set Problems." Working paper, University of Montreal.
10. Campos, V., R. Marti, and M. Laguna. (2000). "Intensification and Diversification with Elite Tabu Search Solutions for the Linear Ordering Problem." Working Paper, University of Colorado at Boulder.
11. Chardaire, P. and A. Sutter. (1994). "A Decomposition Method for Quadratic Zero-One Programming "Management Science 41:4, 704-712.
12. Chiarandini, M. and T. Stutzle. (2002). "An Application of Iterated Local Search to Graph Coloring." In D.S. Johnson, A. Mehrotra, and M. Trick (eds.), Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 112-125.
13. Coudeit, O. (1997). "Exact coloring of Real Life Graphs is Easy." In Proceedings of the 34th Design Automata Conference NY, pp. 121-126.
14. Di Bias, A. Jagota and R. Hughey. (2002). "Energy Function-Based Approaches to Graph Coloring." IEEE Transactions on Neural Networks 13, 81-91.
15. Dorne, R. and J. Hao. (1999). "Tabu Search for Graph Coloring, t-Coloring and set t-Coloring." In S. Voss, S. Martello, I. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, Boston: Kluwer Academic Publisher.
16. Galinier, P. and J. Hao. (1999). "Hybrid Evolutionary Algorithms for Graph Coloring." Journal of Combinatorial Optimization 3(4), 379-397.
17. Gallo, G., P. Hammer, and B. Simeone. (1980). "Quadratic Knapsack Problems." Mathematical Programming 12, 132-149.
18. Glover, F. and M. Laguna. (1997). Tabu Search. Kluwer Academic Publishers.
19. Glover, F. (1998). "A Template for Scatter Search and Path Relinking." School of Business, University of Colorado, Technical Report.
20. Glover, F., G. Kochenberger, B. Alidaee and M.M. Amini. (1999). "Tabu with Search Critical Event Memory: An Enhanced Application for Binary Quadratic Programs." In S. Voss, S. Martello, I. Osman, and C. Roucairol (eds.), Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Boston: Kluwer Academic Publisher.
21. Glover, F., B. Alidaee, C. Rego, and G. Kochenberger. (2002). "One-Pass Heuristics for Large-Scale Unconstrained Binary Quadratic Programs." EJOR 137, 272-287.
22. Glover, F., G. Kochenberger, and B. Alidaee. (1998). "Adaptive Memory Tabu Search for Binary Quadratic Programs." Management Science 44(3), 336-345.
23. Grotschel, M., M. Junger, and G. Reinelt. (1988). "An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design." Operations Research 36(3), 493-513.
24. Hammer, P., E. Boros, and X. Sun. (1998). "On Quadratic Unconstrained Binary Optimization." INFORMS National Meeting, Seattle, October.
25. Hammer, P., P. Hansen, and B. Simone. (1981). "Upper Planes of Quadratic 0/1 Functions and Stability in Graphs." In O. Mangasarian, R. Meyer, and S. Robinson (eds.), Nonlinear Programming 4, New York: Academic Press, pp. 395-414.
26. Hammer, P. and S. Rudeanu. (1968). Boolean Methods in Operations Research. New York: Springer-Verlag.
27. Hansen, P.B. (1979). "Methods of Nonlinear 0-1 Programming." Annals Discrete Math 5, 53-70.
28. Hansen, P., B. Jaumard, and V. Mathon. (1993). "Constrained Nonlinear 0-1 Programming." INFORMS Journal on Computing 5(2), 97-119.
29. Helmberg, C. and F. Rendl. (1998). "Solving Quadratic (0,1)-Problems by Semidefinite Programs and Cutting Planes." Mathematical Programming 82, 291-315.
30. Harary, F. (1953/54). "On the Notion of Balanced of a Signed Graph." Michigan Mathematical Journal 2, 143-146.
31. Iasemidis, L.D., D.S. Shiau, J.C. Sackellares, and P. Pardalos. (2000). "Transition to Epileptic Seizures: Optimization." DIMACS Series in Discrete Math and Theoretical Computer Science 55, 55-73.
32. Katayama, K., M. Tani, and H. Narihisa. (2000). "Solving Large Binary Quadratic Programming Problems by an Effective Genetic Local Search Algorithm." In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO'00). Morgan Kaufmann, pp. 643-650.
33. Kochenberger, G., F. Glover, B. Alidaee, and C. Rego. (2002). "Applications of the Unconstrained Quadratic Binary Program." University of Colorado Working Paper.
34. Krarup, J. and A. Pruzan. (1978). "Computer Aided Layout Design." Mathematical Programming Study 9, 75-94.
35. Laughunn, D.J. (1970). "Quadratic Binary Programming." Operations Research 14, 454-461.
36. Lewandowski, G. and A. Condon. (1996). "Experiments with Parallel Graph Coloring Heuristic and Applications of Graph Coloring." DIMACS Series in Discrete Mathematics and Theoretical Computer Science Providence, RI, American Mathematical Society, Vol. 26, pp. 335-358.
37. Lodi, A., K. Allemand, and T. M. Liebling. (1997). "An Evolutionary Heuristic for Quadratic 0-1 Programming." Technical Report OR-97-12, D.E.I.S., University of Bologna.
38. Mehrotra, A. and M. Trick. (1995). "A Column Generation Approach for Graph Coloring." Working Paper, Carnegie Mellon University.
39. McBride, R.D. and J.S. Yormack. (1980). "An Implicit Enumeration Algorithm for Quadratic Integer Programming." Management Science 26, 282-296.
40. Merz, P. and B. Freisleben. (1999). "Genetic Algorithms for Binary Quadratic Programming." In Proceedings of the 1999 International Genetic and Evolutionary Computation Conference (GECCO'99), Morgan Kaufmann, pp. 417-424.
41. Merz, P. and B. Freisleben. (2002). "Greedy and Local Search Heuristics for the Unconstrained Binary Quadratic Programming Problem." Journal of Heuristics 8(2), 197-213.
42. Merz, P. and K. Katayama. (2004). "Memetic Algorithms for the Unconstrained Binary Quadratic Program." Bio Systems 78(1-3), 99-118.
43. Palubeckis, G. (1995). "A Heuristic-Branch and Bound Algorithm for the Unconstrained Quadratic Zero-One Programming Problem." Computing 284-301.
44. Pardalos, P. and G.P. Rodgers. (1990). "Computational Aspects of a Branch and Bound Algorithm for Quadratic Zero-one Programming." Computing 45, 131-144.
45. Pardalos, P. and G.P. Rodgers. (1992). "A Branch and Bound Algorithm for Maximum Clique problem." Computers & OR 19, 363-375.
46. Pardalos, P. and J. Xue. (1994). "The Maximum Clique Problem." The Journal of Global Optimization 4, 301-328.
47. Phillips, A.T. and J.B. Rosen. (1994). "A Quadratic Assignment Formulation of the Molecular Conformation Problem." The Journal of Global Optimization 4, 229-241.
48. Rosenberg, I. (1972). "0/1 Optimization and Non-Linear Programming." Revue Francaise d'Automatique, d'Informatique et de Recherche Operationnelle (S\'erie Bleue) 2, 95-97.
49. Williams, A.C. (1985). "Quadratic 0-1 Programming Using the Roof Duality with Computational Results." Rutcor Research Report 8-85, Rutgers University, New Brunswick, NJ.
50. Witsgall, C. (1975). "Mathematical Methods of site Selection for Electronic System (EMS)." NBS Internal Report.
51. CONCORDE, http://www.math.princeton.edu/tsp/concorde.html.
52. Concurrent Versions System, http://www.cvshome.org.
53. MIPLIB 3.0. http://www.caam.rice.edu/bixby/miplib/miplib3.html.
54. MPL. http://www.maximal-usa.com.
55. Netcraft. http://www.netcraft.com, July 2001.
56. Open Souce Initiative, http://opensource.org.
57. Problems at DCI. http://www.research.ibm.com/dci/problems.shtml.
58. Anbil, R., F. Barahona, L. Ladanyi, R. Rushmeier, and J. Snowdon. (1999). "Ibm Makes Advances in Airline Optimization." OR/MS Today 26, 26-29.
59. Bahiense, L., F. Barahona, and O. Porto. (2000). "Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation." IBM Research Report RC21847.
60. Balas, E., S. Ceria, and G. Cornuéjols. (1993). "A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs." Math. Programming 58(3, Ser. A), 295-324.
61. Balas, E., S. Ceria, and G. Cornuéjols. (1993). "Solving Mixed 0-1 Programs by a Lift-and-Project Method." In Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), New York, ACM, pp. 232-242.
62. Barahona, F. and R. Anbil. (1999). "Solving Large Scale Uncapacitated Facility Location Problems." IBM Research Report RC21515.
63. Barahona, F. and R. Anbil. (2000). "The Volume Algorithm: Producing Primal Solution with a Subgradient Algorithm." Math. Program 87, 385-399.
64. Barahona, F. and R. Anbil. (2002). "On Some Difficult Linear Programs Coming from Set Partitioning." Discrete Appl. Math 118(1-2), 3-11 ;
65. Third ALIO-EURO Meeting on Applied Combinatorial Optimization (Erice, 1999) .
66. Barahona, F. and F. Chudak. (1999). "Near-Optimal Solutions to Large Scale Facility Location Problems." IBM Research Report RC21606.
67. Barahona, F. and L. Ladanyi. (2001). "Branch and Cut Based on the Volume Algorithm: Steiner Trees in Graphs and Max-Cut." IBM Research Report RC2222.
68. Bixby, R.E., M. Fenelon, Z. Gu, E. Rothberg, and R. Wunderling. (2000). "MIP: Theory and Practice-Closing the Gap." In System modelling and optimization (Cambridge, 1999), Kluwer Acad. Publ., Boston, MA, pp. 19-49.
69. Degraeve, Z. and M. Peeters. (2003). "Optimal Integer Solutions to Industrial Cutting-Stock Problems. II. Benchmark Results." INFORMS J. Comput 15(1), 58-81.
70. Degraeve and L. Schrage. (1999). "Optimal Integer Solutions to Industrial Cutting Stock Problems." INFORMS J. Comput. 11(14), 406-419.
71. Eso, M., S. Gosh, L. Ladanyi, and J. Kalagnanam. (2001). "Bid Evaluation in Procurement Auctions with Piece-Wise Linear Supply Curves." IBM Research Report RC22219.
72. Eso, M., D.L. Jensen, and L. Ladanyi. (2002). "Solving Lexicographic Multiobjective MIP with Column Generation." INFORMS Annual Meeting, San Jose; abstract, pp. 88.
73. Farley, A. (1990). "A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems." Operations Research 38, 922-923.
74. Forrest, J. and J. Tomlin. (1987). "Implementing Interior Point Linear Programming Methods in the Optimization Subroutine Library." IBM System Joumal 31(1), 183-209.
75. Fortz, B., A.R. Mahjoub, S.T. McCormick, and P. Pesneau. (2002). "The 2-edge Connected Subgraph Problem With Bounded Rings." Preprint.
76. Galati, M. (2002). "Galexis Distribution Problem." École Polytechnique Fédérale de Lausanne RO2002.0508.
77. Gau, T. and G. Wäscher. (1995). "Cutgen1: A Problem Generator for the Standard One-Dimensional Cutting Stock Problem." Eur. Jour. of Oper. Res. 84, 572-579.
78. Geoffrion, A. The shared destiny initiative, see http://www.anderson. ucla.edu/informs/sdi.htm.
79. Gilmore, P.C. and R.E. Gomory. (1961). "A Linear Programming Approach to the Cutting-Stock Problem. Oper. Res. 9, 849-859.
80. Guignard, M. and K. Spielberg. (1981). "Logical Reduction Method in Zero-One Programming (Minimal Preferred Variables)." Oper. Res. 29(1), 49-74.
81. Günlük O. and Y. Pochet. (2001). "Mixing Mixed-Integer Inequalities. Math. Programming 90, 429-457.
82. Kalagnanam, J., M. Dawande, M. Trumbo, and H.S. Lee. (2000). "The Surplus Inventory Matching Problem in the Process Industry." Operations Research 48(4), 505-516.
83. Ladanyi, L., J. Forrest, and J. Kalagnanam. (2001). "Column Generation Approach to the Multiple Knapsack Problem with Color Constraints." IBM Research Report RC22013.
84. Lee, J. (2002). "Service-parts Logistics." Tutorial on Supply Chain and Logistics Optimization, Institute for Mathematics and its Applications, University of Minnesota.
85. Lee, J. (2000). Cropped Cubes. IBM Research Report RC21830 In: Journal of Combinatorial Optimization (To appear).
86. Lemke, C.E. and K. Spielberg. (1967). "Direct Search Algorithms for Zero-One and Mixed-Integer Programming." Oper. Res 15, 892-914.
87. Lougee-Heimer, R. (2001). "The Coin-or Initiative: Open Source Software for Optimization." In Proceedings Third International Workshop on Integration of AI and Or Techniques in Constraint Programming for Combinatorial Optimization Problems, pp. 307-319.
88. Lougee-Heimer, R. (2002). "The Common Optimization Interface for Operations Research: Promoting Open-Source Software in the Operations Research Community." IBM Journal of Research and Development 47(1).
89. Lougee-Heimer, R., J.P. Fasano, F. Barahona, B. Dietrich, J. Forrest, R. Harder, L. Ladanyi, T. Pfender, T. Ralphs, M. Saltzman, and K. Scheinberg. (2001). "The Coin-or Initiative: Open Source Accelerates Operations Research Progress." ORMS Today 28(4), 20-22.
90. Lulli, G. and S. Sen. (2001). "A Branch-and-Price Algorithm for Multi-Stage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problem." submitted for publication.
91. Marchand, H. and L.A. Wolsey. (2001). "Aggregation and Mixed Integer Rounding to Solve MIPs." Oper. Res. 49(3), 363-371.
92. Martello, S. and P. Toth. (1990). Knapsack problems. Wiley-Interscience Series in Discrete Mathematics and Optimization." John Wiley & Sons Ltd., Chichester, Algorithms and computer implementations.
93. Mitchell, J.E. (1998). "An Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems." In Operations Research Proceedings 1997 (Jena), Springer: Berlin, pp. 114-119.
94. Murray, W., P. Gill, M. Saunders, and J. Tomlin. (1986). "On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method." Mathematical Programming 36, 183-209.
95. Nediak, M. and J. Eckstein. (2001). "Pivot, Cut, and Dive: A Heuristic for 0-1 Mixed Integer Programming." RUTCOR Research Report RRR 53-2001.
96. Nemhauser, G. and L. Wolsey. (1999). Integer and Combinatorial Optimization. John Wiley & Sons Inc., New York; Reprint of the 1988 original, A Wiley-Interscience Publication.
97. Pesneau, P., A.R. Mahjoub, and S.T. McCormick. (2002). "The 2-Edge Connected Subgraph Problem With Bounded Rings." IFORS.
98. Saltzman, M.J. (2002). "Coin-or: An Open-Source Library for Optimization." In S. Nielsen, (ed.), Software for Compuational Economics and Finance Optimization. Kluwer.
99. Scheithauer, G. and J. Terno. (1995). "A Branch-and-Bound Algorithm for Solving One-Dimensional Cutting Stock Problems Exactly." Appl. Math. (Warsaw) 23(2), 151-167.
100. Valério de Carvalho J.M. (1999). "Exact Solution of Bin-Packing Problems Using Column Generation and Branch-and-Bound." Ann. Oper. Res. 86, 629-659;
101. Advances in combinatorial optimization (London, 1996)
102. Valério de Carvalho J.M. (2002). "A Note on Branch and Price Algorithms for the one Dimensional Cutting Stock Problem." Comput. Optim. Appl. 21(3), 339-340.
103. Vance, P.H. (1998). "Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem." Comput. Optim. Appl. 9(3), 211-228.
104. Vanderbeck, F. (1999). "Computational Study of a Column Generation Algorithm for Bin Packing and Cutting Stock Problems." Math. Program. 86(3, Ser. A), 565-594.
105. Adjiman, C.S., I.P. Androulakis, C.D. Maranas, and C. A. Floudas. (1996). "A Global Optimization Method, α BB, for Process Design." Computers and Chem. Engng. 20, (Suppl.), S419-S424.
106. Adjiman, C.S., I.P. Androulakis, and C.A. Floudas. (1997). "Global Optimization of MINLP Problems in Process Synthesis and Design." Computers and Chem. Engng. 21, (Suppl.), S445-S450.
107. Adjiman, C.S., I.P. Androulakis, and C.A. Floudas. (2000). "Global Optimization of Mixed-Integer Nonlinear Problems." AIChE Journal 46(9), 1769-1797.
108. Balas, E. (1965). "An Additive Algorithm for Solving Linear Programs with Zero-One Variables." Operations Research 13, 517-546.
109. Balas, E. (1979). "Disjunctive Programming ." Annals of Discrete Mathematics 5, 3-51.
110. Balas, E. (1985). "Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems." SIAM J. Alg. Disc. Meth. 6, 466-486.
111. Balas, E., S. Ceria, and G. Cornuejols. (1993). "A Lift-and-Project Cutting Plane Algorithm for Mixed 0-1 Programs." Mathematical Programming 58, 295-324.
112. Beaumont, N. (1991). "An Algorithm for Disjunctive Programs." European Journal of Operations Research 48, 362-371.
113. Benders, J.F. (1962). "Partitioning Procedures for Solving Mixed Variables Programming Problems." Numerische Mathematik 4, 238-252.
114. Borchers, B. and J.E. Mitchell. (1994). "An Improved Branch and Bound Algorithm for Mixed Integer Nonlinear Programming." Computers and Operations Research 21, 359-367.
115. Ceria, S. and J. Soares. (1999). "Convex Programming for Disjunctive Optimization," Mathematical Programming 86(3), 595-614.
116. Crowder, H.P., E.L. Johnson, and M. W. Padberg. (1983) "Solving Large-Scale Zero-One Linear Programming Problems." Operations Research 31, 803-834.
117. Dakin, R.J. (1965). "A Tree Search Algorithm for Mixed Integer Programming Problems." Computer Journal 8, 250-255.
118. Duran, M.A. and I.E. Grossmann. (1986). "An Outer-Approximation Algorithm for a Class of Mixed-Integer Nonlinear Programs." Mathematical Programming 36, 307-339.
119. Fletcher, R. and S. Leyffer. (1994). "Solving Mixed Nonlinear Programs by Outer Approximation." Mathematical Programming 66(3), 327-349.
120. Geoffrion, A.M. (1972). "Generalized Benders Decomposition." Journal of Optimization Theory and Application 10(4), 237-260.
121. Gomory, R.E. (1958). "Outline of an Algorithm for Integer Solutions to Linear Programs." Bulletin of the American Mathematics Society 64, 275-278.
122. Grossmann, I.E. (2002). "Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques for Process Systems Engineering." Journal of Optimization and Engineering (submitted to) 2002.
123. Grossmann, I.E., J.P. Caballero, and H. Yeomans. (1999). "Mathematical Programming Approaches to the Synthesis of Chemical Process Systems." Korean Journal of Chemical Engineering 16(4), 407-426.
124. Grossmann, I.E. and S. Lee. (2003). "Generalized Disjunctive Programming: Nonlinear Convex Hull Relaxation and Algorithms." Computational Optimization and Applications 26, 83-100.
125. Gupta, O.K. and V. Ravindran. (1985). "Branch and Bound Experiments in Convex Nonlinear Integer Programming." Management Science 31(12), 1533-1546.
126. Hentenryck, P.V. (1989). Constraint Satisfaction in Logic Programming. Cambridge, MA: MIT Press.
127. Hiriart-Urruty, J. and C. Lemaréchal. (1993). Convex Analysis and Minimization Algorithms. Berlin, New York: Springer-Verlag.
128. Hooker, J.N. (2000). Logic-Based Methods for Optimization. John Wiley & Sons.
129. Hooker, J.N. and M.A. Osorio. (1999). "Mixed logical/linear programming." Discrete Applied Mathematics 96-97(1-3), 395-442.
130. Horst R. and H. Tuy (1996) Global Optimization: Deterministic Approaches, 3rd ed. Springer-Verlag, Berlin.
131. Johnson, E.L., G.L. Nemhauser, and M.W.P. Savelsbergh. (2000). "Progress in Linear Programming Based Branch-and-Bound Algorithms: An Exposition." INFORMS Journal on Computing 12.
132. Kallrath, J. (2000)."Mixed Integer Optimization in the Chemical Process Industry: Experience, Potential and Future." Trans. I. Chem. E. 78 (Part A), 809-822.
133. Kesavan, P., R.J. Allgor, E.P. Gatzke, and P.I. Barton. (2004). "Outer Approximation Algorithms for Separable Nonconvex Mixed-Integer Nonlinear Programs." Mathematical Programming 100, 517-535.
134. Kesavan, P. and P.I. Barton. (2000). "Generalized Branch-and-Cut Framework for Mixed-Integer Nonlinear Optimization Problems." Computers Chem. Engng. 24, 1361-1366.
135. Kelley, Jr. J.E. (1960). "The Cutting-Plane Method for Solving Convex Programs." Journal of SIAM 8, 703.
136. Kocis, G.R. and I.E. Grossmann. (1987). "Relaxation Strategy for the Structural Optimization of Process Flowsheets." Ind. Eng. Chem. Res. 26, 1869.
137. Kocis, G.R. and I.E. Grossmann. (1989). "A Modelling and Decomposition Strategy for the MINLP Optimization of Process Flowsheets." Computers and Chem. Engng. 13(7), 797-819.
138. Land, A.H. and A.G. Doig. (1960). "An Automatic Method for Solving Discrete Programming Problems." Econometrica 28, 497-520.
139. Lee, S. and I.E. Grossmann. (2000). "New Algorithms for Nonlinear Generalized Disjunctive Programming." Computers Chem. Engng. 24, 2125-2141.
140. Lee, S. and I.E. Grossmann. (2001). "A Global Optimization Algorithm for Nonconvex Generalized Disjunctive Programming and Applications to Process Systems." Computers Chem. Engng. 25, 1675-1697.
141. Leyffer, S. (2001). "Integrating SQP and branch-and-bound for Mixed Integer Nonlinear Programming." Computational Optimization and Applications 18, 295-309.
142. Lovász, L. and A. Schrijver. (1991). "Cones of Matrices and Set-Functions and 0-1 Optimization." SIAM Journal on Optimization 12, 166-190.
143. McCormick, G.P. (1976)."Computability of Global Solutions to Factorable Nonconvex Programs: Part I -Convex Underestimating Problems." Mathematical Programming 10, 147-175.
144. Nemhauser, G.L. and L.A. Wolsey. (1988). Integer and Combinatorial Optimization. New York: Wiley-Interscience.
145. Quesada, I. and I.E. Grossmann. (1992). "An LP/NLP Based Branch and Bound Algorithm for Convex MINLP Optimization Problems. Computers Chem. Engng. 16(10/11), 937-947.
146. Quesada, I. and I.E. Grossmann. (1995). "A Global Optimization Algorithm for Linear Fractional and Bilinear Programs." Journal of Global Optimization 6(1), 39-76.
147. Raman, R. and I.E. Grossmann. (1991). "Relation Between MILP Modelling and Logical Inference for Chemical Process Synthesis." Computers Chem. Engng. 15(2), 73-84.
148. Raman, R. and I.E. Grossmann. (1994). "Modelling and Computational Techniques for Logic Based Integer Programming." Computers Chem. Engng. 18(7), 563-578.
149. Ryoo, H.S. and N.V. Sahinidis. (1995). "Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design." Computers and Chem. Engng. 19(5), 551-566.
150. Sawaya, N.W. and I.E. Grossmann. (2005). "A Cutting Plane Method for Solving Linear Generalized Disjunctive Programming Problems." Computers Chem. Engng (to appear).
151. Sawaya, N.W. and I.E. Grossmann. (2005). "Computational Implementation of Non-Linear Convex Hull Reformulation." Submitted for publication Computers Chem. Engng.
152. Sherali, H.D. and W.P. Adams. (1990). "A Hierarchy of Relaxations Between the Continuous and Convex Hull Representations for Zero-One Programming Problems." SIAM Journal on Discrete Mathematics 3(3), 411-430.
153. Smith, E.M.B. and C.C. Pantelides. (1997). "Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design." Computers Chem. Engng. 21(1001), S791-S796.
154. Stubbs, R. and S. Mehrotra. (1999)."A Branch-and-Cut Method for 0-1 Mixed Convex Programming." Mathematical Programming 86(3), 515-532.
155. Türkay, M. and I.E. Grossmann. (1996). "Logic-based MINLP Algorithms for the Optimal Synthesis of Process Networks." Computers Chem. Engng. 20(8), 959-978.
156. Van Roy, T.J. and L.A. Wolsey. (1986). "Valid Inequalities for Mixed 0-1 Programs." Discrete Applied Mathematics 14, 199-213.
157. Vecchietti, A. and I.E. Grossmann. (1999). "LOGMIP: A Disjunctive 0-1 Nonlinear Optimizer for Process Systems Models." Computers Chem. Engng. 23, 555-565.
158. Viswanathan, J. and I.E. Grossmann. (1990). "A Combined Penalty Function and Outer-Approximation Method for MINLP Optimization." Computers Chem. Engng. 14, 769.
159. Yuan, X, S. Zhang, L. Piboleau, and S. Domenech. (1988). "Une Methode d' optimization Nonlineare en Variables Mixtes pour la Conception de Porcedes." Rairo Recherche. Operationnele. 22, 331.
160. Westerlund, T. and F. Pettersson. (1995). "An Extended Cutting Plane Method for Solving Convex MINLP Problems." Computers Chem. Engng. 19(supl.), S131-S136.
161. Williams, H.P. (1985). Mathematical Building in Mathematical Programming. Chichester; John Wiley.
162. Zamora, J.M. and I.E. Grossmann. (1999). "A Branch and Bound Algorithm for Problems with Concave Univariate, Bilinear and Linear Fractional Terms." Journal of Global Optimization 14(3), 217-249.