메뉴 건너뛰기




Volumn 59, Issue 2-3, 2014, Pages 503-526

ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations

Author keywords

Branch and cut; Deterministic global optimization; MINLP; Optimization software

Indexed keywords

ALGORITHMS; GLOBAL OPTIMIZATION; NONLINEAR EQUATIONS; QUADRATIC PROGRAMMING;

EID: 84903200433     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-014-0166-2     Document Type: Article
Times cited : (454)

References (151)
  • 1
    • 76749148362 scopus 로고    scopus 로고
    • SCIP: Solving constraint integer programs
    • Achterberg, T.: SCIP: Solving constraint integer programs. Math. Program. Comput. 1(1), 1-41 (2009)
    • (2009) Math. Program. Comput , vol.1 , Issue.1 , pp. 1-41
    • Achterberg, T.1
  • 4
    • 0032552252 scopus 로고    scopus 로고
    • A global optimization method, αbb, for general twice differentiable nlps-ii. Implementation and computional results
    • Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, αBB, for general twice differentiable NLPs-II. Implementation and computional results. Comput. Chem. Eng. 22, 1159-1179 (1998b)
    • (1998) Comput. Chem. Eng , vol.22 , pp. 1159-1179
    • Adjiman, C.S.1    Androulakis, I.P.2    Floudas, C.A.3
  • 5
    • 0032552250 scopus 로고    scopus 로고
    • Aglobal optimizationmethod,αbb, for general twice differentiable nlps-i. Theoretical advances
    • Adjiman,C.S., Dallwig, S., Floudas, C.A., Neumaier, A.:Aglobal optimizationmethod,αBB, for general twice differentiable NLPs-I. Theoretical advances. Comput. Chem. Eng. 22, 1137-1158 (1998a)
    • (1998) Comput. Chem. Eng , vol.22 , pp. 1137-1158
    • Adjiman, C.S.1    Dallwig, S.2    Floudas, C.A.3    Neumaier, A.4
  • 6
    • 84870314275 scopus 로고    scopus 로고
    • Available from CyberInfrastructure forMINLP [A collaboration of CMU and IBM Research] at
    • Ahmetović, E., & Grossmann, I.E.: Integrated process water networks design problem (2010). Available from CyberInfrastructure forMINLP [A collaboration of CMU and IBM Research] at: www.minlp.org/ library/problem/index. php?i=101
    • (2010) Integrated Process Water Networks Design Problem
    • Ahmetović, E.1    Grossmann, I.E.2
  • 7
    • 78650971191 scopus 로고    scopus 로고
    • Global superstructure optimization for the design of integrated process water networks
    • Ahmetović, E., Grossmann, I.E.: Global superstructure optimization for the design of integrated process water networks. AIChE J. 57(2), 434-457 (2011)
    • (2011) AIChE J , vol.57 , Issue.2 , pp. 434-457
    • Ahmetović, E.1    Grossmann, I.E.2
  • 8
    • 0020752471 scopus 로고
    • Jointly constrained biconvex programming
    • Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math.Oper. Res. 8(2), 273-286 (1983)
    • (1983) Math.Oper. Res , vol.8 , Issue.2 , pp. 273-286
    • Al-Khayyal, F.A.1    Falk, J.E.2
  • 10
    • 0001327501 scopus 로고
    • Bb: A global optimization method for general constrained nonconvex problems
    • Androulakis, I.P., Maranas, C.D., Floudas, C.A.: αBB: A global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7, 337-363 (1995)
    • (1995) J. Glob. Optim , vol.7 , pp. 337-363
    • Androulakis, I.P.1    Maranas, C.D.2    Floudas, C.A.3
  • 11
    • 2942696007 scopus 로고    scopus 로고
    • Recent advances in the solution of quadratic assignment problems
    • Anstreicher, K.M.: Recent advances in the solution of quadratic assignment problems. Math. Program. 97(1-2), 27-42 (2003)
    • (2003) Math. Program , vol.97 , Issue.1-2 , pp. 27-42
    • Anstreicher, K.M.1
  • 12
    • 59449105344 scopus 로고    scopus 로고
    • Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
    • Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2-3), 471-484 (2009)
    • (2009) J. Glob. Optim , vol.43 , Issue.2-3 , pp. 471-484
    • Anstreicher, K.M.1
  • 13
    • 84870363789 scopus 로고    scopus 로고
    • On convex relaxations for quadratically constrained quadratic programming
    • Anstreicher, K.M.: On convex relaxations for quadratically constrained quadratic programming. Math. Program. 136(2), 233-251 (2012)
    • (2012) Math. Program , vol.136 , Issue.2 , pp. 233-251
    • Anstreicher, K.M.1
  • 14
    • 0001280939 scopus 로고    scopus 로고
    • A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
    • Audet, C., Hansen, P., Jaumard, B., Savard, G.: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Math. Program. 87(1), 131-152 (2000)
    • (2000) Math. Program , vol.87 , Issue.1 , pp. 131-152
    • Audet, C.1    Hansen, P.2    Jaumard, B.3    Savard, G.4
  • 15
    • 68949144575 scopus 로고    scopus 로고
    • Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs
    • Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically-constrained quadratic programs. Optim. Methods Softw. 24(4-5), 485-504 (2009)
    • (2009) Optim. Methods Softw , vol.24 , Issue.4-5 , pp. 485-504
    • Bao, X.1    Sahinidis, N.V.2    Tawarmalani, M.3
  • 17
    • 68949107324 scopus 로고    scopus 로고
    • Branching and bounds tightening techniques for non-convex minlp
    • Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Method. Softw. 24(4-5), 597-634 (2009)
    • (2009) Optim. Method. Softw , vol.24 , Issue.4-5 , pp. 597-634
    • Belotti, P.1    Lee, J.2    Liberti, L.3    Margot, F.4    Wächter, A.5
  • 21
    • 84861225438 scopus 로고    scopus 로고
    • On the optimal design of water distribution networks: A practical minlp approach
    • Bragalli, C., DAmbrosio, C., Lee, J., Lodi, A., Toth, P.: On the optimal design of water distribution networks: a practical MINLP approach. Optim. Eng. 13, 219-246 (2012)
    • (2012) Optim. Eng , vol.13 , pp. 219-246
    • Bragalli, C.1    Dambrosio, C.2    Lee, J.3    Lodi, A.4    Toth, P.5
  • 23
    • 31144448332 scopus 로고    scopus 로고
    • The design of the boost interval arithmetic library
    • Brönnimann, H., Melquiond, G., Pion, S.: The design of the Boost interval arithmetic library. Theor. Comput. Sci. 351, 111-118 (2006)
    • (2006) Theor. Comput. Sci , vol.351 , pp. 111-118
    • Brönnimann, H.1    Melquiond, G.2    Pion, S.3
  • 24
    • 84868627824 scopus 로고    scopus 로고
    • Non-convex mixed-integer nonlinear programming: A survey
    • Burer, S., Letchford, A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97-106 (2012)
    • (2012) Surv. Oper. Res. Manag. Sci , vol.17 , Issue.2 , pp. 97-106
    • Burer, S.1    Letchford, A.N.2
  • 25
    • 38749116247 scopus 로고    scopus 로고
    • A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
    • Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113(2), 259-282 (2008)
    • (2008) Math. Program , vol.113 , Issue.2 , pp. 259-282
    • Burer, S.1    Vandenbussche, D.2
  • 26
    • 3843076327 scopus 로고    scopus 로고
    • MINLPLib: A collection of test models for mixed-integer nonlinear programming
    • Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib: a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput 15(1), 114-119 (2003)
    • (2003) INFORMS J. Comput , vol.15 , Issue.1 , pp. 114-119
    • Bussieck, M.R.1    Drud, A.S.2    Meeraus, A.3
  • 27
    • 84855352605 scopus 로고    scopus 로고
    • MINLP solver software
    • Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.), Wiley, New York
    • Bussieck, M.R., Vigerske, S.: MINLP solver software. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.)WileyEncyclopedia ofOperations Research andManagement Science. Wiley, New York (2010)
    • (2010) WileyEncyclopedia OfOperations Research AndManagement Science
    • Bussieck, M.R.1    Vigerske, S.2
  • 28
    • 0035897468 scopus 로고    scopus 로고
    • Generalized disjunctive programming model for the optimal synthesis of thermally linked distillation columns
    • Caballero, J.A., Grossmann, I.E.: Generalized disjunctive programming model for the optimal synthesis of thermally linked distillation columns. Ind. Eng. Chem. Res. 40(10), 2260-2274 (2001)
    • (2001) Ind. Eng. Chem. Res , vol.40 , Issue.10 , pp. 2260-2274
    • Caballero, J.A.1    Grossmann, I.E.2
  • 29
    • 4143122018 scopus 로고    scopus 로고
    • Design of distillation sequences: From conventional to fully thermally coupled distillation systems
    • Caballero, J.A., Grossmann, I.E.: Design of distillation sequences: from conventional to fully thermally coupled distillation systems. Comput. Chem. Eng. 28(11), 2307-2329 (2004)
    • (2004) Comput. Chem. Eng , vol.28 , Issue.11 , pp. 2307-2329
    • Caballero, J.A.1    Grossmann, I.E.2
  • 30
    • 33846120154 scopus 로고    scopus 로고
    • Structural considerations and modeling in the synthesis of heat integrated thermally coupled distillation sequences
    • Caballero, J.A., Grossmann, I.E.: Structural considerations and modeling in the synthesis of heat integrated thermally coupled distillation sequences. Ind. Eng. Chem. Res. 45(25), 8454-8474 (2006)
    • (2006) Ind. Eng. Chem. Res , vol.45 , Issue.25 , pp. 8454-8474
    • Caballero, J.A.1    Grossmann, I.E.2
  • 32
    • 77954818560 scopus 로고    scopus 로고
    • On convex relaxations of quadrilinear terms
    • Cafieri, S., Lee, J., Liberti, L.: On convex relaxations of quadrilinear terms. J. Glob. Optim. 47, 661-685 (2010)
    • (2010) J. Glob. Optim , vol.47 , pp. 661-685
    • Cafieri, S.1    Lee, J.2    Liberti, L.3
  • 33
    • 34250002552 scopus 로고    scopus 로고
    • Optimal periodic scheduling of multistage continuous plants with single and multiple time grid formulations
    • Castro, P., Novais, A.: Optimal periodic scheduling of multistage continuous plants with single and multiple time grid formulations. Ind. Eng. Chem. Res. 46(11), 3669-3683 (2007)
    • (2007) Ind. Eng. Chem. Res , vol.46 , Issue.11 , pp. 3669-3683
    • Castro, P.1    Novais, A.2
  • 34
    • 84870313282 scopus 로고    scopus 로고
    • Available from CyberInfrastructure forMINLP [A collaboration ofCMUand IBMResearch] at
    • Castro, P., Novais, A.: Periodic scheduling of continuous multiproduct plants (2009). Available from CyberInfrastructure forMINLP [A collaboration ofCMUand IBMResearch] at:www.minlp.org/library/ problem/index.php?i=34
    • (2009) Periodic Scheduling of Continuous Multiproduct Plants
    • Castro, P.1    Novais, A.2
  • 35
    • 34047141729 scopus 로고    scopus 로고
    • An efficient heuristic procedure for the optimal design of wastewater treatment systems
    • Castro, P.M., Matos, H.A., Novais, A.Q.: An efficient heuristic procedure for the optimal design of wastewater treatment systems. Resour. Conserv. Recycl. 50(2), 158-185 (2007)
    • (2007) Resour. Conserv. Recycl , vol.50 , Issue.2 , pp. 158-185
    • Castro, P.M.1    Matos, H.A.2    Novais, A.Q.3
  • 36
    • 84874414112 scopus 로고    scopus 로고
    • Comparison of global optimization algorithms for the design of water-using networks
    • Castro, P.M., Teles, J.P.: Comparison of global optimization algorithms for the design of water-using networks. Comput. Chem. Eng. 52, 249-261 (2013)
    • (2013) Comput. Chem. Eng , vol.52 , pp. 249-261
    • Castro, P.M.1    Teles, J.P.2
  • 37
    • 60649108203 scopus 로고    scopus 로고
    • Linear program-based algorithm for the optimal design of wastewater treatment systems
    • Castro, P.M., Teles, J.P., Novais, A.Q.: Linear program-based algorithm for the optimal design of wastewater treatment systems. Clean Technol. Environ. Policy 11(1), 83-93 (2009)
    • (2009) Clean Technol. Environ. Policy , vol.11 , Issue.1 , pp. 83-93
    • Castro, P.M.1    Teles, J.P.2    Novais, A.Q.3
  • 38
    • 34250812542 scopus 로고    scopus 로고
    • Global optimization in stabilizing controller design
    • Chang, Y.J., Sahinidis, N.V.: Global optimization in stabilizing controller design. J. Glob. Optim. 38, 509-526 (2007)
    • (2007) J. Glob. Optim , vol.38 , pp. 509-526
    • Chang, Y.J.1    Sahinidis, N.V.2
  • 41
    • 84875371603 scopus 로고    scopus 로고
    • Mixed integer nonlinear programming tools: An updated practical overview
    • D'Ambrosio, C., Lodi, A.: Mixed integer nonlinear programming tools: an updated practical overview. Ann. Oper. Res. 204, 301-320 (2013)
    • (2013) Ann. Oper. Res , vol.204 , pp. 301-320
    • D'Ambrosio, C.1    Lodi, A.2
  • 42
    • 28244496090 scopus 로고    scopus 로고
    • Benchmarking optimization softwarewith performance profiles
    • Dolan, E.D., Moré, J.J.: Benchmarking optimization softwarewith performance profiles.Math. Program. 91, 201-213 (2002)
    • (2002) Math. Program , vol.91 , pp. 201-213
    • Dolan, E.D.1    Moré, J.J.2
  • 43
    • 77954760060 scopus 로고    scopus 로고
    • Constraint propagation on quadratic constraints
    • Domes, F., Neumaier, A.: Constraint propagation on quadratic constraints. Constraints 15(3), 404-429 (2010)
    • (2010) Constraints , vol.15 , Issue.3 , pp. 404-429
    • Domes, F.1    Neumaier, A.2
  • 44
    • 84870314398 scopus 로고    scopus 로고
    • Rigorous enclosures of ellipsoids and directed cholesky factorizations
    • Domes, F., Neumaier, A.: Rigorous enclosures of ellipsoids and directed cholesky factorizations. SIAM J. Matrix Anal. Appl. 32, 262-285 (2011)
    • (2011) SIAM J. Matrix Anal. Appl , vol.32 , pp. 262-285
    • Domes, F.1    Neumaier, A.2
  • 45
    • 0022699346 scopus 로고
    • A mixed-integer nonlinear programming algorithm for process systems synthesis
    • Duran, M.A., Grossmann, I.E.: A mixed-integer nonlinear programming algorithm for process systems synthesis. AIChE J. 32(4), 592-606 (1986a)
    • (1986) AIChE J , vol.32 , Issue.4 , pp. 592-606
    • Duran, M.A.1    Grossmann, I.E.2
  • 46
    • 0022902024 scopus 로고
    • An outer-approximation algorithm for a class of mixed-integer nonlinear programs
    • Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307-339 (1986b)
    • (1986) Math. Program , vol.36 , pp. 307-339
    • Duran, M.A.1    Grossmann, I.E.2
  • 52
    • 68049141586 scopus 로고    scopus 로고
    • A review of recent advances in global optimization
    • Floudas, C.A., Gounaris, C.E.: A review of recent advances in global optimization. J. Glob. Optim. 45(1), 3-38 (2009)
    • (2009) J. Glob. Optim , vol.45 , Issue.1 , pp. 3-38
    • Floudas, C.A.1    Gounaris, C.E.2
  • 53
    • 34249760465 scopus 로고
    • State-of-The-art in global optimization: Computational methods and applications-preface
    • Floudas, C.A., Pardalos, P.M.: State-of-the-art in global optimization: computational methods and applications-Preface. J. Glob. Optim. 7(2), 113 (1995)
    • (1995) J. Glob. Optim , vol.7 , Issue.2 , pp. 113
    • Floudas, C.A.1    Pardalos, P.M.2
  • 56
    • 77949398720 scopus 로고    scopus 로고
    • Convexity and concavity detection in computational graphs: Tree walks for convexity assessment
    • Fourer, R., Maheshwari, C., Neumaier, A., Orban, D., Schichl, H.: Convexity and concavity detection in computational graphs: tree walks for convexity assessment. INFORMS J. Comput 22(1), 26-43 (2010)
    • (2010) INFORMS J. Comput , vol.22 , Issue.1 , pp. 26-43
    • Fourer, R.1    Maheshwari, C.2    Neumaier, A.3    Orban, D.4    Schichl, H.5
  • 57
    • 0003278702 scopus 로고    scopus 로고
    • Construction of convex relaxations using automated code generation techniques
    • Gatzke, E.P., Tolsma, J.E., Barton, P.I.: Construction of convex relaxations using automated code generation techniques. Optim. Eng. 3, 305-326 (2002)
    • (2002) Optim. Eng , vol.3 , pp. 305-326
    • Gatzke, E.P.1    Tolsma, J.E.2    Barton, P.I.3
  • 58
    • 33645637249 scopus 로고    scopus 로고
    • Implementation and testing of a branch-and-bound based method for deterministic global optimization: Operations research applications
    • Floudas, C.A., Pardalos, P.M. (eds.), Kluwer, Dordrecht
    • Gau, C.Y., Schrage, L.E.: Implementation and testing of a branch-and-bound based method for deterministic global optimization: operations research applications. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 145-164. Kluwer, Dordrecht (2003)
    • (2003) Frontiers in Global Optimization , pp. 145-164
    • Gau, C.Y.1    Schrage, L.E.2
  • 59
    • 0000462003 scopus 로고
    • Elements of large-scale mathematical programming. 1. Concepts
    • Geoffrion, A.M.: Elements of large-scale mathematical programming. 1. Concepts. Manag. Sci. Ser. Theory 16(11), 652-675 (1970)
    • (1970) Manag. Sci. Ser. Theory , vol.16 , Issue.11 , pp. 652-675
    • Geoffrion, A.M.1
  • 61
    • 84903362580 scopus 로고    scopus 로고
    • Estimation of diffusion anisotropy in microporous crystalline materials and optimization of crystal orientation in membranes
    • Gounaris, C.E., First, E.L., Floudas, C.A.: Estimation of diffusion anisotropy in microporous crystalline materials and optimization of crystal orientation in membranes. J. Chem. Phys. 139(12), 124703 (2013)
    • (2013) J. Chem. Phys , vol.139 , Issue.12 , pp. 124703
    • Gounaris, C.E.1    First, E.L.2    Floudas, C.A.3
  • 62
    • 49249107681 scopus 로고    scopus 로고
    • Convexity of products of univariate functions and convexification transformations for geometric programming
    • Gounaris, C.E., Floudas, C.A.: Convexity of products of univariate functions and convexification transformations for geometric programming. J. Optim. Theory Appl. 138, 407-427 (2008)
    • (2008) J. Optim. Theory Appl , vol.138 , pp. 407-427
    • Gounaris, C.E.1    Floudas, C.A.2
  • 63
    • 84869488689 scopus 로고    scopus 로고
    • Advances in mathematical programming models for enterprise-wide optimization
    • Grossmann, I.E.: Advances in mathematical programming models for enterprise-wide optimization. Comput. Chem. Eng. 47, 2-18 (2012)
    • (2012) Comput. Chem. Eng , vol.47 , pp. 2-18
    • Grossmann, I.E.1
  • 64
    • 77954540618 scopus 로고    scopus 로고
    • Scope for the application of mathematical programming techniques in the synthesis and planning of sustainable processes
    • Grossmann, I.E., Guillén-Gosálbez, G.: Scope for the application of mathematical programming techniques in the synthesis and planning of sustainable processes. Comput. Chem. Eng. 34(9), 1365-1376 (2010)
    • (2010) Comput. Chem. Eng , vol.34 , Issue.9 , pp. 1365-1376
    • Grossmann, I.E.1    Guillén-Gosálbez, G.2
  • 66
    • 84901504842 scopus 로고    scopus 로고
    • Available from CyberInfrastructure forMINLP [A collaboration of CMU and IBM Research] at
    • Guillén-Gosálbez, G., Pozo, C.: Optimization of metabolic networks in biotechnology (2010). Available from CyberInfrastructure forMINLP [A collaboration of CMU and IBM Research] at: www.minlp.org/ library/problem/ index.php?i=81
    • (2010) Optimization of Metabolic Networks in Biotechnology
    • Guillén-Gosálbez, G.1    Pozo, C.2
  • 67
    • 74049099516 scopus 로고    scopus 로고
    • Identifying quantitative operation principles in metabolic pathways: A systematic method for searching feasible enzyme activity patterns leading to cellular adaptive responses
    • Guillén-Gosálbez, G., Sorribas, A.: Identifying quantitative operation principles in metabolic pathways: a systematic method for searching feasible enzyme activity patterns leading to cellular adaptive responses. BMC Bioinform. 10, 386 (2009)
    • (2009) BMC Bioinform , vol.10 , pp. 386
    • Guillén-Gosálbez, G.1    Sorribas, A.2
  • 68
    • 59549087550 scopus 로고    scopus 로고
    • Cutting circles and polygons from area-minimizing rectangles
    • Kallrath, J.: Cutting circles and polygons from area-minimizing rectangles. J. Glob. Optim. 43, 299-328 (2009)
    • (2009) J. Glob. Optim , vol.43 , pp. 299-328
    • Kallrath, J.1
  • 69
    • 84903220967 scopus 로고    scopus 로고
    • Cutting ellipses from area-minimizing rectangles
    • doi:10.1007/s10898-013-0125-3
    • Kallrath, J., Rebennack, S.: Cutting ellipses from area-minimizing rectangles. J. Glob. Optim. 1-33 (2013). doi:10.1007/s10898-013-0125-3
    • (2013) J. Glob. Optim , pp. 1-33
    • Kallrath, J.1    Rebennack, S.2
  • 70
    • 33344476205 scopus 로고    scopus 로고
    • Global optimization for the synthesis of integrated water systems in chemical processes
    • Karuppiah, R., Grossmann, I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30, 650-673 (2006)
    • (2006) Comput. Chem. Eng , vol.30 , pp. 650-673
    • Karuppiah, R.1    Grossmann, I.E.2
  • 71
    • 84859270389 scopus 로고    scopus 로고
    • Convex envelopes of products of convex and component-wise concave functions
    • Khajavirad, A., Sahinidis, N.V.: Convex envelopes of products of convex and component-wise concave functions. J. Glob. Optim. 52, 391-409 (2012)
    • (2012) J. Glob. Optim , vol.52 , pp. 391-409
    • Khajavirad, A.1    Sahinidis, N.V.2
  • 72
    • 84878600877 scopus 로고    scopus 로고
    • Convex envelopes generated from finitely many compact convex sets
    • Khajavirad, A., Sahinidis, N.V.: Convex envelopes generated from finitely many compact convex sets. Math. Program. 137(1-2), 371-408 (2013)
    • (2013) Math. Program , vol.137 , Issue.1-2 , pp. 371-408
    • Khajavirad, A.1    Sahinidis, N.V.2
  • 73
    • 84902679521 scopus 로고    scopus 로고
    • Fixed-flowrate total water network synthesis under uncertainty with risk management
    • doi:10.1016/j.jclepro.2014.01.023
    • Khor, C.S., Chachuat, B., Shah, N.: Fixed-flowrate total water network synthesis under uncertainty with risk management. J. Clean. Prod. (2014). doi:10.1016/j.jclepro.2014.01.023
    • (2014) J. Clean. Prod
    • Khor, C.S.1    Chachuat, B.2    Shah, N.3
  • 74
    • 0024063926 scopus 로고
    • Global optimization of nonconvex mixed-integer nonlinear programming (minlp) problems in process synthesis
    • Kocis, G.R., Grossmann, I.E.: Global optimization of nonconvex mixed-integer nonlinear programming (MINLP) problems in process synthesis. Ind. Eng. Chem. Res. 27(8), 1407-1421 (1988)
    • (1988) Ind. Eng. Chem. Res , vol.27 , Issue.8 , pp. 1407-1421
    • Kocis, G.R.1    Grossmann, I.E.2
  • 75
    • 84876323323 scopus 로고    scopus 로고
    • Global optimization of bilinear programs with a multiparametric disaggregation technique
    • Kolodziej, S.P., Castro, P.M., Grossmann, I.E.: Global optimization of bilinear programs with a multiparametric disaggregation technique. J. Glob. Optim. 57(4), 1039-1063 (2013a)
    • (2013) J. Glob. Optim , vol.57 , Issue.4 , pp. 1039-1063
    • Kolodziej, S.P.1    Castro, P.M.2    Grossmann, I.E.3
  • 76
    • 84876343458 scopus 로고    scopus 로고
    • A discretization-based approach for the optimization of the multiperiod blend scheduling problem
    • Kolodziej, S.P., Grossmann, I.E., Furman, K.C., Sawaya, N.W.: A discretization-based approach for the optimization of the multiperiod blend scheduling problem. Comput. Chem. Eng. 53, 122-142 (2013b)
    • (2013) Comput. Chem. Eng , vol.53 , pp. 122-142
    • Kolodziej, S.P.1    Grossmann, I.E.2    Furman, K.C.3    Sawaya, N.W.4
  • 77
    • 14644439840 scopus 로고    scopus 로고
    • A rigorous global filtering algorithm for quadratic constraints
    • Lebbah, Y., Michel, C., Rueher, M.: A rigorous global filtering algorithm for quadratic constraints. Constraints 10(1), 47-65 (2005)
    • (2005) Constraints , vol.10 , Issue.1 , pp. 47-65
    • Lebbah, Y.1    Michel, C.2    Rueher, M.3
  • 78
    • 0030151372 scopus 로고    scopus 로고
    • Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management
    • Lee, H., Pinto, J.M., Grossmann, I.E., Park, S.: Mixed-integer linear programming model for refinery short-term scheduling of crude oil unloading with inventory management. Ind. Eng. Chem. Res. 35(5), 1630-1641 (1996)
    • (1996) Ind. Eng. Chem. Res , vol.35 , Issue.5 , pp. 1630-1641
    • Lee, H.1    Pinto, J.M.2    Grossmann, I.E.3    Park, S.4
  • 79
    • 35248883941 scopus 로고    scopus 로고
    • Improving the robustness and efficiency of crude scheduling algorithms
    • Li, J., Li, A., Karimi, I.A., Srinivasan, R.: Improving the robustness and efficiency of crude scheduling algorithms. AIChE J. 53(10), 2659-2680 (2007)
    • (2007) AIChE J , vol.53 , Issue.10 , pp. 2659-2680
    • Li, J.1    Li, A.2    Karimi, I.A.3    Srinivasan, R.4
  • 80
    • 83255192156 scopus 로고    scopus 로고
    • Continuous-time modeling and global optimization approach for scheduling of crude oil operations
    • Li, J., Misener, R., Floudas, C.A.: Continuous-time modeling and global optimization approach for scheduling of crude oil operations. AIChE J. 58(1), 205-226 (2012a)
    • (2012) AIChE J , vol.58 , Issue.1 , pp. 205-226
    • Li, J.1    Misener, R.2    Floudas, C.A.3
  • 81
    • 79954530923 scopus 로고    scopus 로고
    • Stochastic pooling problem for natural gas production network design and operation under uncertainty
    • Li, X., Armagan, E., Tomasgard, A., Barton, P.I.: Stochastic pooling problem for natural gas production network design and operation under uncertainty. AIChE J. 57(8), 2120-2135 (2011)
    • (2011) AIChE J , vol.57 , Issue.8 , pp. 2120-2135
    • Li, X.1    Armagan, E.2    Tomasgard, A.3    Barton, P.I.4
  • 82
    • 84869495971 scopus 로고    scopus 로고
    • Decomposition strategy for the stochastic pooling problem
    • Li, X., Tomasgard, A., Barton, P.I.: Decomposition strategy for the stochastic pooling problem. J. Glob. Optim. 54(4), 765-790 (2012b)
    • (2012) J. Glob. Optim , vol.54 , Issue.4 , pp. 765-790
    • Li, X.1    Tomasgard, A.2    Barton, P.I.3
  • 83
    • 84867931017 scopus 로고    scopus 로고
    • Convex envelopes ofmonomials of odd degree
    • Liberti, L., Pantelides, C.C.: Convex envelopes ofmonomials of odd degree. J. Glob.Optim. 25, 157-168 (2003)
    • (2003) J. Glob.Optim , vol.25 , pp. 157-168
    • Liberti, L.1    Pantelides, C.C.2
  • 84
    • 33747721378 scopus 로고    scopus 로고
    • An exact reformulation algorithm for large nonconvex nlps involving bilinear terms
    • Liberti, L., Pantelides, C.C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Glob. Optim. 36(2), 161-189 (2006)
    • (2006) J. Glob. Optim , vol.36 , Issue.2 , pp. 161-189
    • Liberti, L.1    Pantelides, C.C.2
  • 85
    • 68949107822 scopus 로고    scopus 로고
    • The global solver in the lindo api
    • Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4-5), 657-668 (2009)
    • (2009) Optim. Methods Softw , vol.24 , Issue.4-5 , pp. 657-668
    • Lin, Y.1    Schrage, L.2
  • 86
    • 84897107741 scopus 로고    scopus 로고
    • On convex envelopes for bivariate functions over polytopes
    • doi:10.1007/s10107-012-0616-x
    • Locatelli, M., Schoen, F.: On convex envelopes for bivariate functions over polytopes. Math. Program. (2012). doi:10.1007/s10107-012-0616-x
    • (2012) Math. Program
    • Locatelli, M.1    Schoen, F.2
  • 88
    • 0037230473 scopus 로고    scopus 로고
    • The commonoptimization interface for operations research: Promoting open-source software in the operations research community
    • Lougee-Heimer,R.: The commonoptimization INterface for operations research: promoting open-source software in the operations research community. IBM J. Res. Dev. 47(1), 57-66 (2003)
    • (2003) IBM J. Res. Dev , vol.47 , Issue.1 , pp. 57-66
    • Lougee-Heimer, R.1
  • 89
    • 84884284808 scopus 로고    scopus 로고
    • A reformulation framework for global optimization
    • Lundell, A., Skjäl, A., Westerlund, T.: A reformulation framework for global optimization. J. Glob. Optim. 57(1), 115-141 (2013)
    • (2013) J. Glob. Optim , vol.57 , Issue.1 , pp. 115-141
    • Lundell, A.1    Skjäl, A.2    Westerlund, T.3
  • 90
    • 59449084808 scopus 로고    scopus 로고
    • Some transformation techniques with applications in global optimization
    • Lundell, A.,Westerlund, J.,Westerlund, T.: Some transformation techniques with applications in global optimization. J. Glob. Optim. 43, 391-405 (2009)
    • (2009) J. Glob. Optim , vol.43 , pp. 391-405
    • Lundell, A.1    Westerlund, J.2    Westerlund, T.3
  • 91
    • 68949101640 scopus 로고    scopus 로고
    • Convex underestimation strategies for signomial functions
    • Lundell, A.,Westerlund, T.: Convex underestimation strategies for signomial functions.Optim.Methods Softw. 24(4-5), 505-522 (2009)
    • (2009) Optim.Methods Softw , vol.24 , Issue.4-5 , pp. 505-522
    • Lundell, A.1    Westerlund, T.2
  • 93
    • 34249758275 scopus 로고
    • Finding all solutions of nonlinearly constrained systems of equations
    • Maranas, C.D., Floudas, C.A.: Finding all solutions of nonlinearly constrained systems of equations. J. Glob. Optim. 7(2), 143-182 (1995)
    • (1995) J. Glob. Optim , vol.7 , Issue.2 , pp. 143-182
    • Maranas, C.D.1    Floudas, C.A.2
  • 94
    • 0030871124 scopus 로고    scopus 로고
    • Global optimization in generalized geometric programming
    • Maranas, C.D., Floudas, C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351-369 (1997)
    • (1997) Comput. Chem. Eng , vol.21 , Issue.4 , pp. 351-369
    • Maranas, C.D.1    Floudas, C.A.2
  • 95
    • 34250381644 scopus 로고
    • Computability of global solutions to factorable nonconvex programs: Part 1-convex underestimating problems
    • McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part 1-convex underestimating problems. Math. Program. 10(1), 147-175 (1976)
    • (1976) Math. Program , vol.10 , Issue.1 , pp. 147-175
    • McCormick, G.P.1
  • 96
    • 0030244667 scopus 로고    scopus 로고
    • Glopeq: A new computational tool for the phase and chemical equilibrium problem
    • McDonald, C.M., Floudas, C.A.: Glopeq: a new computational tool for the phase and chemical equilibrium problem. Comput. Chem. Eng. 21(1), 1-23 (1996)
    • (1996) Comput. Chem. Eng , vol.21 , Issue.1 , pp. 1-23
    • McDonald, C.M.1    Floudas, C.A.2
  • 97
  • 98
    • 4544226754 scopus 로고    scopus 로고
    • Trilinear monomials with positive or negative domains: Facets of the convex and concave envelopes
    • Floudas, C.A., Pardalos, P.M. (eds.), Kluwer, Dordrecht
    • Meyer, C.A., Floudas, C.A.: Trilinear monomials with positive or negative domains: facets of the convex and concave envelopes. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 327-352. Kluwer, Dordrecht (2003)
    • (2003) Frontiers in Global Optimization , pp. 327-352
    • Meyer, C.A.1    Floudas, C.A.2
  • 99
    • 4544251356 scopus 로고    scopus 로고
    • Trilinear monomials with mixed sign domains: Facets of the convex and concave envelopes
    • Meyer, C.A., Floudas, C.A.: Trilinear monomials with mixed sign domains: facets of the convex and concave envelopes. J. Glob. Optim. 29(2), 125-155 (2004)
    • (2004) J. Glob. Optim , vol.29 , Issue.2 , pp. 125-155
    • Meyer, C.A.1    Floudas, C.A.2
  • 100
    • 21144433578 scopus 로고    scopus 로고
    • Convex envelopes for edge-concave functions
    • Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Program. 103(2), 207-224 (2005)
    • (2005) Math. Program , vol.103 , Issue.2 , pp. 207-224
    • Meyer, C.A.1    Floudas, C.A.2
  • 101
    • 70249135313 scopus 로고    scopus 로고
    • Advances for the pooling problem: Modeling, global optimization, and computational studies
    • Misener, R., Floudas, C.A.: Advances for the pooling problem: modeling, global optimization, and computational studies. Appl. Comput. Math. 8(1), 3-22 (2009)
    • (2009) Appl. Comput. Math , vol.8 , Issue.1 , pp. 3-22
    • Misener, R.1    Floudas, C.A.2
  • 102
    • 84870311206 scopus 로고    scopus 로고
    • Global optimization of mixed-integer models with quadratic and signomial functions: A review
    • Misener, R., Floudas, C.A.: Global optimization of mixed-integer models with quadratic and signomial functions: a review. Appl. Comput. Math. 11(3), 317-336 (2012a)
    • (2012) Appl. Comput. Math , vol.11 , Issue.3 , pp. 317-336
    • Misener, R.1    Floudas, C.A.2
  • 103
    • 84870469140 scopus 로고    scopus 로고
    • Global optimization of mixed-integer quadratically-constrained quadratic programs (miqcqp) through piecewise-linear and edge-concave relaxations
    • Misener, R., Floudas, C.A.: Global optimization of mixed-integer quadratically-constrained quadratic programs (MIQCQP) through piecewise-linear and edge-concave relaxations. Math. Program. B 136, 155-182 (2012b)
    • (2012) Math. Program. B , vol.136 , pp. 155-182
    • Misener, R.1    Floudas, C.A.2
  • 104
    • 84901481760 scopus 로고    scopus 로고
    • A framework for globally optimizing mixed-integer signomial programs
    • doi:10.1007/s10957-013-0396-3
    • Misener, R., Floudas, C.A.: A framework for globally optimizing mixed-integer signomial programs. J. Optim. Theory Appl. (2013). doi:10.1007/s10957-013-0396-3
    • (2013) J. Optim. Theory Appl
    • Misener, R.1    Floudas, C.A.2
  • 105
    • 84875951353 scopus 로고    scopus 로고
    • GloMIQO: Global mixed-integer quadratic optimizer
    • Misener, R., Floudas, C.A.: GloMIQO: global mixed-integer quadratic optimizer. J. Glob. Optim. 57(1), 3-50 (2013b)
    • (2013) J. Glob. Optim , vol.57 , Issue.1 , pp. 3-50
    • Misener, R.1    Floudas, C.A.2
  • 107
    • 79954598126 scopus 로고    scopus 로고
    • APOGEE: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes
    • Misener, R., Thompson, J.P., Floudas, C.A.: APOGEE: global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Comput. Chem. Eng. 35(5), 876-892 (2011)
    • (2011) Comput. Chem. Eng , vol.35 , Issue.5 , pp. 876-892
    • Misener, R.1    Thompson, J.P.2    Floudas, C.A.3
  • 108
    • 70450198575 scopus 로고    scopus 로고
    • McCormick-based relaxations of algorithms
    • Mitsos, A., Chachuat, B., Barton, P.I.: McCormick-based relaxations of algorithms. SIAM J. Optim. 20(2), 573-601 (2009)
    • (2009) SIAM J. Optim , vol.20 , Issue.2 , pp. 573-601
    • Mitsos, A.1    Chachuat, B.2    Barton, P.I.3
  • 109
    • 84870330591 scopus 로고    scopus 로고
    • Available fromCyberInfrastructure for MINLP [A collaboration of Carnegie Mellon University and IBM Research] at
    • Mouret, S., Grossmann, I.E.:Crude-oil operations scheduling (2010).Available fromCyberInfrastructure for MINLP [A collaboration of Carnegie Mellon University and IBM Research] at: www.minlp.org/ library/problem/index. php?i=117
    • (2010) Crude-oil Operations Scheduling
    • Mouret, S.1    Grossmann, I.E.2
  • 110
    • 70349306845 scopus 로고    scopus 로고
    • A novel priority-slot based continuous-time formulation for crude-oil scheduling problems
    • Mouret, S., Grossmann, I.E., Pestiaux, P.: A novel priority-slot based continuous-time formulation for crude-oil scheduling problems. Ind. Eng. Chem. Res. 48(18), 8515-8528 (2009)
    • (2009) Ind. Eng. Chem. Res , vol.48 , Issue.18 , pp. 8515-8528
    • Mouret, S.1    Grossmann, I.E.2    Pestiaux, P.3
  • 111
    • 78049409094 scopus 로고    scopus 로고
    • 2010 supporting global numerical optimization of rational functions by generic symbolic convexity tests
    • Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds)
    • Neun,W., Sturm, T., Vigerske, S. (2010) Supporting global numerical optimization of rational functions by generic symbolic convexity tests. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing, volume 6244 of Lecture Notes in Computer Science, pp. 205-219 (2010)
    • (2010) Computer Algebra in Scientific Computing, Volume 6244 of Lecture Notes in Computer Science , pp. 205-219
    • Neun, W.1    Sturm, T.2    Vigerske, S.3
  • 112
    • 63449111241 scopus 로고    scopus 로고
    • A new decomposition approach for the thermal unit commitment problem
    • Niknam, T., Khodaei, A., Fallahi, F.: A new decomposition approach for the thermal unit commitment problem. Appl. Energy 86(9), 1667-1674 (2009)
    • (2009) Appl. Energy , vol.86 , Issue.9 , pp. 1667-1674
    • Niknam, T.1    Khodaei, A.2    Fallahi, F.3
  • 115
    • 84871643558 scopus 로고    scopus 로고
    • An efficient reformulation of the multiechelon stochastic inventory system with uncertain demands
    • Nyberg, A., Grossmann, I.E., Westerlund, T.: An efficient reformulation of the multiechelon stochastic inventory system with uncertain demands. AIChE J. 59(1), 23-28 (2013)
    • (2013) AIChE J , vol.59 , Issue.1 , pp. 23-28
    • Nyberg, A.1    Grossmann, I.E.2    Westerlund, T.3
  • 116
    • 0001822918 scopus 로고
    • Aglobal optimization algorithm for linear fractional and bilinear programs
    • Quesada, I.,Grossmann, I.E.:Aglobal optimization algorithm for linear fractional and bilinear programs. J. Glob. Optim. 6(1), 39-76 (1995)
    • (1995) J. Glob. Optim , vol.6 , Issue.1 , pp. 39-76
    • Quesada, I.1    Grossmann, I.E.2
  • 117
    • 84870358573 scopus 로고    scopus 로고
    • Available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at
    • Ruiz, J.P., Grossmann, I.E.:Water treatment network design (2009). Available from CyberInfrastructure for MINLP [www.minlp.org, a collaboration of Carnegie Mellon University and IBM Research] at: www.minlp.org/library/problem/ index.php?i=24
    • (2009) Water Treatment Network Design
    • Ruiz, J.P.1    Grossmann, I.E.2
  • 118
    • 0001545210 scopus 로고
    • Global optimization of nonconvex nlps and minlps with applications in process design
    • Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19(5), 551-566 (1995)
    • (1995) Comput. Chem. Eng , vol.19 , Issue.5 , pp. 551-566
    • Ryoo, H.S.1    Sahinidis, N.V.2
  • 119
    • 0000635160 scopus 로고    scopus 로고
    • A branch-and-reduce approach to global optimization
    • Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8, 107-138 (1996)
    • (1996) J. Glob. Optim , vol.8 , pp. 107-138
    • Ryoo, H.S.1    Sahinidis, N.V.2
  • 121
    • 77955175439 scopus 로고    scopus 로고
    • Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
    • Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124(1-2), 383-411 (2010)
    • (2010) Math. Program , vol.124 , Issue.1-2 , pp. 383-411
    • Saxena, A.1    Bonami, P.2    Lee, J.3
  • 122
    • 49749150553 scopus 로고    scopus 로고
    • A clique algorithm for standard quadratic programming
    • Scozzari, A., Tardella, F.: A clique algorithm for standard quadratic programming. Discret. Appl.Math. 156(13), 2439-2448 (2008)
    • (2008) Discret. Appl.Math , vol.156 , Issue.13 , pp. 2439-2448
    • Scozzari, A.1    Tardella, F.2
  • 123
    • 38849098993 scopus 로고    scopus 로고
    • A short-term operational planning model for natural gas production systems
    • Selot, A., Kuok, L.K., Robinson, M.,Mason, T.L., Barton, P.I.: A short-term operational planning model for natural gas production systems. AIChE J. 54(2), 495-515 (2008)
    • (2008) AIChE J , vol.54 , Issue.2 , pp. 495-515
    • Selot, A.1    Kuok, L.K.2    Robinson, M.3    Mason, T.L.4    Barton, P.I.5
  • 124
    • 84859269747 scopus 로고    scopus 로고
    • Reduced rlt representations for nonconvex polynomial programming problems
    • Sherali, H., Dalkiran, E., Liberti, L.: Reduced RLT representations for nonconvex polynomial programming problems. J. Glob. Optim. 52(3), 447-469 (2012)
    • (2012) J. Glob. Optim , vol.52 , Issue.3 , pp. 447-469
    • Sherali, H.1    Dalkiran, E.2    Liberti, L.3
  • 126
    • 34249831859 scopus 로고
    • A new reformulation-linearization technique for bilinear programming problems
    • Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Glob. Optim. 2, 379-410 (1992)
    • (1992) J. Glob. Optim , vol.2 , pp. 379-410
    • Sherali, H.D.1    Alameddine, A.2
  • 127
    • 0003374522 scopus 로고
    • A reformulation-convexification approach for solving nonconvex quadratic-programming problems
    • Sherali, H.D., Tuncbilek, C.H.: A reformulation-convexification approach for solving nonconvex quadratic-programming problems. J. Glob. Optim. (7): 1, 1-31 (1995)
    • (1995) J. Glob. Optim , vol.1 , Issue.7 , pp. 1-31
    • Sherali, H.D.1    Tuncbilek, C.H.2
  • 128
    • 0009656296 scopus 로고    scopus 로고
    • New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems
    • Sherali, H.D., Tuncbilek, C.H.: New reformulation linearization/ convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1-9 (1997)
    • (1997) Oper. Res. Lett , vol.21 , Issue.1 , pp. 1-9
    • Sherali, H.D.1    Tuncbilek, C.H.2
  • 129
    • 84861428342 scopus 로고    scopus 로고
    • On jet-convex functions and their tensor products
    • Shikhman, V., Stein, O.: On jet-convex functions and their tensor products. Optimization 61(6), 717-731 (2012)
    • (2012) Optimization , vol.61 , Issue.6 , pp. 717-731
    • Shikhman, V.1    Stein, O.2
  • 130
    • 0033134718 scopus 로고    scopus 로고
    • A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex minlps
    • Smith, E.M.B., Pantelides, C.C.: A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23(4-5), 457-478 (1999)
    • (1999) Comput. Chem. Eng , vol.23 , Issue.4-5 , pp. 457-478
    • Smith, E.M.B.1    Pantelides, C.C.2
  • 131
    • 84880980331 scopus 로고    scopus 로고
    • Algorithms for an integer multicommodity network flow problem with node reliability considerations
    • doi:10.1007/s10957-013-0378-5
    • Tadayon, B., Smith, J.C.: Algorithms for an integer multicommodity network flow problem with node reliability considerations. J. Optim. Theory Appl. (2013). doi:10.1007/s10957-013-0378-5.
    • (2013) J. Optim. Theory Appl
    • Tadayon, B.1    Smith, J.C.2
  • 132
    • 43249094995 scopus 로고
    • On a class of functions attaining their maximum at the vertices of a polyhedron
    • Tardella, F.: On a class of functions attaining their maximum at the vertices of a polyhedron. Discret. Appl. Math. 22, 191-195 (1988/89)
    • (1988) Discret. Appl. Math , vol.22 , pp. 191-195
    • Tardella, F.1
  • 133
    • 18244371288 scopus 로고    scopus 로고
    • On the existence of polyhedral convex envelopes
    • Floudas, C.A., Pardalos, P.M. (eds.), Kluwer, Dordrecht
    • Tardella, F.: On the existence of polyhedral convex envelopes. In: Floudas, C.A., Pardalos, P.M. (eds.) Frontiers in Global Optimization, pp. 563-573. Kluwer, Dordrecht (2003)
    • (2003) Frontiers in Global Optimization , pp. 563-573
    • Tardella, F.1
  • 134
    • 43249114404 scopus 로고    scopus 로고
    • Existence and sum decomposition of vertex polyhedral convex envelopes
    • Tardella, F.: Existence and sum decomposition of vertex polyhedral convex envelopes. Optim. Lett. 2, 363-375 (2008)
    • (2008) Optim. Lett , vol.2 , pp. 363-375
    • Tardella, F.1
  • 135
    • 84875419816 scopus 로고    scopus 로고
    • Explicit convex and concave envelopes through polyhedral subdivisions
    • Tawarmalani, M., Richard, J.-P.P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138(1-2), 531-577 (2013)
    • (2013) Math. Program , vol.138 , Issue.1-2 , pp. 531-577
    • Tawarmalani, M.1    Richard, J.-P.P.2    Xiong, C.3
  • 136
    • 0035364533 scopus 로고    scopus 로고
    • Semidefinite relaxations of fractional programs via novel convexification techniques
    • Tawarmalani, M., Sahinidis, N.V.: Semidefinite relaxations of fractional programs via novel convexification techniques. J. Glob. Optim. 20, 133-154 (2001)
    • (2001) J. Glob. Optim , vol.20 , pp. 133-154
    • Tawarmalani, M.1    Sahinidis, N.V.2
  • 138
    • 2942665751 scopus 로고    scopus 로고
    • Global optimization of mixed-integer nonlinear programs: A theoretical and computational study
    • Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563-591 (2004)
    • (2004) Math. Program , vol.99 , pp. 563-591
    • Tawarmalani, M.1    Sahinidis, N.V.2
  • 139
    • 21144437792 scopus 로고    scopus 로고
    • A polyhedral branch-and-cut approach to global optimization
    • Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225-249 (2005)
    • (2005) Math. Program , vol.103 , pp. 225-249
    • Tawarmalani, M.1    Sahinidis, N.V.2
  • 140
    • 36148931377 scopus 로고    scopus 로고
    • Lp-based solution strategies for the optimal design of industrial water networks with multiple contaminants
    • Teles, J., Castro, P.M., Novais, A.Q.: Lp-based solution strategies for the optimal design of industrial water networks with multiple contaminants. Chem. Eng. Sci. 63(2), 376-394 (2008)
    • (2008) Chem. Eng. Sci , vol.63 , Issue.2 , pp. 376-394
    • Teles, J.1    Castro, P.M.2    Novais, A.Q.3
  • 141
    • 84860371723 scopus 로고    scopus 로고
    • Global optimization of water networks design using multiparametric disaggregation
    • Teles, J.P., Castro, P.M., Matos, H.A.: Global optimization of water networks design using multiparametric disaggregation. Comput. Chem. Eng. 40, 132-147 (2012)
    • (2012) Comput. Chem. Eng , vol.40 , pp. 132-147
    • Teles, J.P.1    Castro, P.M.2    Matos, H.A.3
  • 142
    • 17444382397 scopus 로고    scopus 로고
    • A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
    • Vandenbussche, D., Nemhauser, G.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102(3), 559-575 (2005a)
    • (2005) Math. Program , vol.102 , Issue.3 , pp. 559-575
    • Vandenbussche, D.1    Nemhauser, G.L.2
  • 143
    • 17444372087 scopus 로고    scopus 로고
    • A polyhedral study of nonconvex quadratic programs with box constraints
    • Vandenbussche, D., Nemhauser, G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102(3), 531-557 (2005b)
    • (2005) Math. Program , vol.102 , Issue.3 , pp. 531-557
    • Vandenbussche, D.1    Nemhauser, G.L.2
  • 146
    • 0025496615 scopus 로고
    • Simultaneous optimization models for heat integrationii. Heat exchanger network synthesis
    • Yee, T.F., Grossmann, I.E.: Simultaneous optimization models for heat integrationII. Heat exchanger network synthesis. Comput. Chem. Eng. 14(10), 1165-1184 (1990)
    • (1990) Comput. Chem. Eng , vol.14 , Issue.10 , pp. 1165-1184
    • Yee, T.F.1    Grossmann, I.E.2
  • 147
    • 54949092825 scopus 로고    scopus 로고
    • Mixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory management
    • You, F., Grossmann, I.E.: Mixed-integer nonlinear programming models and algorithms for large-scale supply chain design with stochastic inventory management. Ind. Eng. Chem. Res. 47(20), 7802-7817 (2008)
    • (2008) Ind. Eng. Chem. Res , vol.47 , Issue.20 , pp. 7802-7817
    • You, F.1    Grossmann, I.E.2
  • 150
    • 74349113522 scopus 로고    scopus 로고
    • Integrated multi-echelon supply chain design with inventories under uncertainty: Minlp models, computational strategies
    • You, F., Grossmann, I.E.: Integrated multi-echelon supply chain design with inventories under uncertainty: MINLP models, computational strategies. AIChE J. 56(2), 419-440 (2010)
    • (2010) AIChE J , vol.56 , Issue.2 , pp. 419-440
    • You, F.1    Grossmann, I.E.2
  • 151


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.