Adjiman, C.S., Androulakis, L.P., and Floundas, C.A., (2000). Global Optimiza-tion of Mixed Integer Nonlinear Problems. AIChE Journal September 2000. Vol. 46, No. 9, 1769–1790.
Belotti,P., et al., (2009). Branching dan Bounds Tightening Techniques for Non-Convex MINLP. Optimization Methods and Software, 24(4).597–634
Belotti, P., et al., (2012). Mixed Integer Nonlinear Optimization. Argonne National Laboratory. Preprint ANL/MCS-P3060-1121.
Belotti, P.,(2012). Disjunctive Cuts For Nonconvex MINLP. The IMA Volumes in Mathematics and Its Applications. Volume 154, 1–19.
Benders, J., (1962). Partitioning Procedures for Solving Mixed Variable Program-ming Problems. Numerische Mathematik, 4: 267–299.
Berthold, T; and Gleixner, A., (2010). Undercover-Primal MINLP Heuristic. In P. Bonami, L. Liberti, A. Miller and A. Sartenaer (eds.) Proceedings of the European Workshop on MINLP. Marseille. 103–113.
Bertsimas, D.P., (1999). Nonlinear Programming. Athena Scientific.
Bertsimas. D., Omid Nohadani, O., and Teo, K.M., (2009) Non Convex Robust Optimization for Problems with Constraint. INFORMS Journal Computing. 1–15.
Biegler, L.T., and Grossmann, I.E., (2004). Retrospetive on Optimization. Else-vier. Computers and Chimical Engineering28, 1169–1192.
Bonami, P., et al., (2008). An Algorithmic Framework for Convex Mixed Integer Nonlinear Programs. Discrete Optimization, 5: 186–204.
Bonami, P., and. Goncalves, J.P.M., (2008). Primal heuristics for mixed integer nonlinear programs. IBM. Research Report RC24639.
Bonami, P., et al., (2009). A Feasibility Pump for Mixed Integer Nonlinear Pro-grams. Mathematical Programming 119, 331–352.
Borchers, B., and Mitchell, J.E., (1991). An Improved Branch and Bound Algo-rithm for Mixed Integer Nonlinear Programs. R.P.I. Math ReportNo. 200.
Boyd. S., and Vandenberghe., (2009). Convex Optimization.Cambridge University Press.
Bragalli, C., et al., (2006). An MINLP Solution Method for a Water Network Problem. Springer: Computer Sciencevol. 4168. 696–707.
Burer, S., and Letchford, A.N., (2012). Non-Convex Mixed-Integer Nonlinear Pro-gramming: Operation Research and Management Scienc, 17. 97–106.
Cai. X., et al., (2001). Solving Large Non-Convex Water Resources Management Models Using Genenalized Benders Decomposition. INFORMS, Vol. 49, No. 2, 235-245
Chachuat, B., (2007). Nonlinear and Dynamic Optimization: From Theory to Practice. EPFL, Switzerland. 1–20.
Christina, O., and Stephen, W.J., (2006). Active Set Identification in Nonlinear Progamming. SIAM J, OPTIM. Vol. 17, No. 2, 577–605.
Chung,H., Polak,E., and Sastry, S., (2009). An External Active-Set Strategy for Solving Optimal Control Problems.IEEE, Transactions On Automatic Con-trol, Vol. 54, No. 5, 1129–1133.
Chung,H., Polak,E., and Sastry, S. (2010). On the Use of Outer Approximations as an External Active Set Strategy. J Optim Theory Appl146, 51-75.
Dakin, R.J., (1965). A Tree-Search Algorithm for Mixed Integer Programming Problems. Computer Journal 8, 250–255.
D’Ambrosio., et al., (2010). Experiments with a Feasibility Pump Approach for Nonconvex MINLPs. SpringerLink. Computer Science, Volume 6049, 350– 360.
DAmbrosio, C., et all., (2012). A Storm of Feasibility Pumps for Nonconvex MINLP. Mathematical programming, 136 (2), 375–402.
Duran, M.A., and Grossmann, I. E., (1986a). An Outer-Approximation Algorithm for A Class of Mixed-Integer Nonlinear Programs. Mathematical Program-ming 36, 307–339.
Duran, M.A., and Grossmann, I. E., (1986b). A Mixed-Integer Nonlinear Program-ming Algorithm for Process Systems Synthesis.AIChE Journal, Vol 32, No.4, 592–606.
Fernandes, P.F., et al., (2010). A Deterministic-Stochastic Method for Nonconvex MINLP Problems. 2nd International Conference on Engineering Optomisa-tion. Lisbon, Portugal. September 6-9, 2010., 1–6.
Fernandes, P.F.,et al.,(2011). Assessment of a Hybrid Approach for Nonconvex Constrained MINLP Problems. Proceedings of the 11th International Con-ference on Computational and Mathematical Methods in Science and Engi-neering. CMMSE. Juni 26-30 2011, 1–12.
Fischeti. M., and Lodi. A., (2003). Local Branching. Math. Program. Ser.B 98, 23–47.
Fischetti, M., Glover, F., and Lodi, A., (2005). The feasibility Pump.Math. Pro-gram, Ser. A 104, 91-104.
Fletcher, R., and Leyffer, S., (1994). Solving Mixed Integer Nonlinear Programs by Outer Approximation. Mat. Program, 66, 327–349.
Floudas, C.A., (1989). Global Optimum Search for Nonconvex NLP and MINLP Problems. Computers Chem. Eng. 13, 1117–1132.
Fugenschuh, A, et al., (2010). Mixed-Integer Nonlinear Problems in Transporta-tion ApplicaTransporta-tions. 2nd International Conference on Engineering Optimiza-tion. September 6-9, 2010, Lisbon, Portugal
Gao, D. Y., Ruan, N., and Sherali., (2009). Solution and Optimality Criteria for Nonconvex Constrained Global Optimization Problems with Connection Bet-ween Canonical and Lagragian Duality. J Glob Optim 45, 473–497.
Geoffrion, A. M., (1972). A Generalized Benders Decomposition,J. Op-tim. Theory Appl, 10 (4), 237-260.
Gareyd, M.R., and Johnson, D.S., (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Company.
Grossman, I. E., and Floudas, C. A., (1987). Active Constraint Strategy for Flexi-bility Analysis in Chemical Proses.Comput.Chem. engng, Vol. 11, No. 6, 675 – 693.
Grossmann, I. E., and Sahidinis, N.V., (2002). Review of Nonlinear Mixed-Integer and Disjunctive Programming Techniques.Optimization and Engineering, 3, 227-252.
Guerra, A., Newman, A.M., and Leyffer, S., (2011). Concrete Structure Design Using Mixed-Integer Nonlinear Programming with Complementarity Con-straints. SIAM J. Optim, Vol 21, No.3, 833–863.
Gupta, O.K., and Ravindran, V., (1985). Branch and Bound Experiments in Con-vex Nonlinear Integer Programming. Mangement Science, 31, 1533–1546.
Hare, W.L., and Lewis, A.S., (2004). Identifying Active Constraints Via Partial Smoothness and Prox-Regularity. Journal of Convex Analysis Vol 11, 251– 266.
Harjunkoski, I., Westerlund, T., and Porn, R., 1999. Numerical and Environmental Considerations on a Complex Industrial Mixed Integer Non-Linear Program-ming (MINLP) Problem. Comput. &Chem. Eng.,23, 1545–1561.
Hiller, F.S., and Lieberman,G.J., (2005) Introduction Opererations Research. 8th Edition. McGraw-Hill Companies.Inc
Hiller, F.S., and Lieberman,G.J., (2005). Introduction Opererations Research. 8th Edition. McGraw-Hill Companies.Inc
Kallrath, J., (2005). Solving Planning and Design Problems in the Process Industry Using Mixed Integer and Global Optimization.Annals of Operations Research 140, 339–373.
Kesavan, P.,et al.,(2004) Outer approximation algorithms for separable nonconvex Digital Object Identifier. Math. Program., Ser. A 100, 517-535
Kocis, G. R., and Grossmann, I.E., (1988). Global Optimizzation of Nonconvex MINLP Prolems in Process Synthesis. Ind. Engng Chem 27, 1407.
Kravanja, S., and Zula, T., (2010). The MINLP Approach to Structural Synthe-sis. Challenges, Opportunities and Solutions in Structural Engineering and Construction. Taylor & Francis Group, London, ISBN 978-0-415-56809-8, 427–432.
Lee S., and Grossmann, I.E., (2000). A Global Optimization Algorithm for Non-convex Generalized Disjunctive Programming and Applications to Process Systems. http://www.mat.univie.ac.at/neum/glopt/mss/LeeG02.pdf.
Lee, S., and Grossmann, I. E., (2005). Logic-Based Modeling and Solution of Non-linear Discrete/Continious Optimization Problems.Annals of Operation Re-search 139, 267–288.
Lee, S., and Wah, B., (2008). Finding Good Starting Points For Solving Structured and Unstructured Nonlinear Constrained Optimization Problems.20th IEEE International Conference on Tools with Artificial Intelligence, 469–476.
Lewis, R. M., Torczon, V., and Trosset, M. W., (2000). Direct search methods: then and now. Elsevier, Journal of Computational and Applied Mathematics 124, 191–207.
Lewis, R. M., and Torczon, V., (2009). Active Set Identivication Without Explicit Derivatives. SIAM J. Optim. Vol. 20, No.3, 1378–1405.
Leyffer, S., Sartenaer, A., and Wanufelle, E., (2008). Branch-and-Refine for Mixed-Integer Non-Convex Global Optimization.Mathematics and Computer Scien-ce. Division Preprint ANL/MCS-P1547-0908 October 02, 2008. 1–29.
Li, D., Sun, X., and McKinnon, K., (2000). An Exact Solution Method for Re-liability Optimization Problems in Complex Systems. http://www.Maths .ed.ac.uk/mckinnon/MS/00-018/paper. pdf, 1–14.
Li, M., and Vicente, L. N., (2013). Inexact Solution of NLP Subproblems in MINLP. Journal of Global Optimization. 1–23.
Liberti, L., and Marculan, N., (2006). Global Optimization: From Theory to Im-plementation. Springer. 211–262.
Liberti,L., Miladenovie,N., and Nannicini.G., (2011). A Recipe for Finding Good Solutions to MINLPs. Mathematical Programming Computation3, 349–390.
Lunden, A., Wes, J., and Westerlund, T., (2009) Some Transformation Techniques with Applicationsin Global Optimization. J Glob Optim. 43, 391-405.
Marcovecchio, M.G., Bergamini, L. M., and Aguirre, P. A., (2006) Improve-and-Branch Algorithm for the Global Optimization of Nonconvex NLP Problems. Journal of Golbal Optimizzation 34, 339–368.
Martin, A; Moller, M; and Moritz, S., (2006). Mixed Integer Models for the Sta-tionary Case of Gas Network Optimization. Math. Program. 105,563–582.
Mawengkang, H., and B. A Murtagh, A., (1986). Solving Nonlinear Integer Pro-grams with Large-Scale Optimization Software. Annals of Operations Re-search. 5425–437
Mawengkang, H., (2000). Solving Integer Programs with Large-Scale Optimization Software. APDSI, 1–9
Mawengkang, H.,et al., (2012). An Improved Direct Search Approach for Solving Mixed Integer Non-Linear Programming Problems. Global Journal & Tech-nolongy Optimization, Vol 3, 94–100.
Mital,K.V., (1976). Optimization Methods. John Wiley and Sons, New Delhi
Mistos, A., (2010). Global Solution of Nonlinear Mixed Integer Bilevel Programs. J Glob Optim 47, 557 – 582.
Murtagh, B. A., and Saunders, M. A., (1976). Nonlinear Programming for Large, Sparse Systems. Technical Report Sol. 76-15, 1-58.
Murtagh, B. A., and Saunders, M. A., 1978. Large-Scale Linearly Constrained Optimization. Mathematical Programming 14, 41–72
Murtagh, B. A., and Saunders, M. A., (1982). A Projected Lagrangian Algorithm and Its Implementation for Sparse Nonlinear Constraints.Mathematical Pro-gramming 16, 84-117.
Murtagh, B. A., and Saunders, M. A., (2003). Minos 5.51 User,s Guide.Technical Report Sol 83-20R. 4-13.
Murty, K.G., (1976). Some NP Complete Problem in Quadratic and Nonlinear Programming. Math Progr, 39. 117–129.
Murty, K.G., and Yu, F.T., (1997). Linear Complementarity, Linear and Nonlinear Programming. Internet Edition.
Nannicini, G., Liberti, L., and Nenad, M., (2011). A Recipe for Finding Good Solutions to MINLPs. Math. Prog. Comp. 3, 349-390.
Nannicini, G., and Belotti, P., (2012). Rounding-Based Heuristics for Nonconvex MINLPs. Math. Prog. Comp. 4, 1–31.
Nowak, I., and Vigerske, S., (2008). LaGO: A (Heuristic) Branch and Cut algorithm for Nonconvex MINLPs. CEJOR 16, 127-138.
Oberlin, C., and Wright, S.J.,(2006) Active Set Identification in Nonlinear Pro-gramming. SIAM J. OPTIM. 2006. Vol. 17, No. 2. 577-605.
Queseda, I., and Grossmann, I., (1992). An LP/NLP Based Branch and Bound Algorithm for MINLP Optimization Problems. Elsevier, An International Journal of Computer Applications in Chemical Engineering, Vol 16, 937–947.
Parnier, E. R., (1987). An Active Set Method for Solving Liniarly Constrained Nonsmooth Optimization Problems.Mathematical Programming37, 269–292.
Rao. S. S., (2009). Engineering Optimization. Theory and Practice. Fourth Edition. John Wiley & Sons, Inc. Hoboken, New Jersey.
Rebennack, S., Kallrath, J., and Pardalos, P.M., (2009) Column Enumeration Based Decomposition Techniques for a Class of Non-convex MINLP prob-lems. Springer Science Business Media, LLC. 277–298.
Robert M.L., Virginia T., and Michael W., T., (2000). Direct search methods: then and now. Elsevier, Journal of Computational and Applied Mathematics124. 191–207
Ruis J.P., and Grossmann I, E., (2011). Using Convex Nonlinear Relaxations in the Global Optimization of Nonconvex Generalized Disjunctive Programs. http:// egon.cheme cmu edu/papers/Ruizgrossmann RELNCGDP.Pdf. 1–27.
Ryoo, H.S., and Sahinidis, N.V., (1995). Global Optimization of Nonconvex NLPs and MINLPs with Applications in Process Design.Computers Chem. Vol.19. No. 5, 551–566.
Schluter, M., Egea, J.A., and Banga, J.R., (2008). Extended Ant Colony Opti-mization for non-convex Mixed Integer Nonlinear Programming. Mat. Pro-gramming 1–22
Shandiz R. A., and Amiri N.M., (2011). An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems. American Journal of Operations Research, 1. 185–189.
Scraf, H.E., (1986). Testing for Optimality In the Absence of Convexity.@ Cam-bridge University Press. 117–133.
Shandiz, R. A., and Amiri, N.M., (2011). An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems. American Journal of Operations Research, 1. 185–189.
Smith, E., and Pantelides, C., (1999). A Symbolic Reformulation/Spatial Branch and Bound Algorithm for the Global Optimization of Nonconvex MINLPs. Comput. Chem. Eng 23, 457–478.
Sugden, S. J., (1999). A Class of Direct Search Methods for Nonlinear Integer Pro-gramming.Ph.D Dissertation. School of Information & Computing Sciences, BOND UNIVERSITY.
Tambunan. H., and Mawengkang, H., (2011). Improving A Direct Search for Sol-ving Mixed Integer Non Linear Programming Problems. Proceding of the International Seminar on Operation Researh, Interior 2011, 88–103.
Tambunan, H., and Mawengkang, H., (2012). On Solving Non-Convex Mixed In-teger Non-Linear Programming Problems Using Active Constraint Strategy. Conference Programme EURO 2012. Vilnius, Lithuania, 8-11 Juli 2012,78.
Tambunan, H., and Mawengkang, H., (2013). Direct Search Approach for Non-Convex Mixed Integer Non-Linear Programming Problems. Abstract Book. Conference Programme, 26th EURO 2013. Rome, 1-4 July 2013, 5.
Tambunan, H., and Mawengkang, H., (2014). Direct Search Approach for Non-Convex Mixed Integer Non-Linear Programming Problems. Proceding. ICM-SA, Terangganu, Malaysia.
Tambunan, H., and Mawengkang, H., (2015). Mixed Integer Programming Model for Open Vehicle Routing Problem with Fleet and Driver Scheduling Consi-dering Delivery and Pick-Up Simultaneously.International Journal on Recent and Innovation Trends in Computing and Communication. Vol 3, 5508–5513.
Tawarmalani, M., and Sahinidis, N., (2004). Global Optimization of Mixed Integer Nonlinear Programs: A Theoretical and Computation Study. Mat. Program 99, 563-591.
Wah, W.B., and Chen, Y.,(2006). Constraint Partitioning in Penalty Formulations for Solving Temporal Planning Problems. Elsevier. 170, 187–231.
Wasanapradit, T., et al., (2011). Solving Mixed Integer Nonlinear Programming Problems Using Inproved Genetic Algorithms. Korea J. Chem. Eng, 28 (1),32–40.
Westerlund, T., and Petersson, F., (1995). A Cutting Plane Method for Solving Convex MINLP Problems. Computers Eng., 19, 131–136.
Westernlund, T., and Porn, R., (2000). A Cutting Plane Method for Minimizing Pseudoconvex Fuction in the Mixed Integer Case. Computers and Chemical Engineering 22, 357–365.
Yang, X. Q., and Huang, X. X., (2001). A Nonlinear Lagrangian Approach to Constrained Optimization Problems.SIAM J. OPTIM, Vol. 11, No. 4, 1119– 1144.
Yu, J., and Yu, Z., (2010). A lagragian Dual Spectral Projected Gradient Method for Nonconvex Constrained Optimization. AMO, Vol 12, Number 2, 273– 282.
