-
1
-
-
0032552250
-
A global optimization method, αBB, for general twice-differentiable constrained NLPs - I. Theoretical advances
-
C. S. Adjiman, S. Dallwig, C. A. Floudas, and A. Neumaier. A global optimization method, αBB, for general twice-differentiable constrained NLPs - I. Theoretical advances. Computers and Chemical Engineering, pages (1137-1158), 1998.
-
(1998)
Computers and Chemical Engineering
, pp. 1137-1158
-
-
Adjiman, C.S.1
Dallwig, S.2
Floudas, C.A.3
Neumaier, A.4
-
2
-
-
0003086747
-
Rigorous convex underestimates for general twice-differentiable problems
-
C. S. Adjiman and C. A. Floudas. Rigorous convex underestimates for general twice-differentiable problems. J. of Global Opt., 9:23-40, 1997.
-
(1997)
J. of Global Opt.
, vol.9
, pp. 23-40
-
-
Adjiman, C.S.1
Floudas, C.A.2
-
4
-
-
3843076327
-
MINLPLib - A Collection of Test Models for Mixed-Iinteger Nonlinear Programming
-
M. R. Bussieck, A. S. Drud, and A. Meeraus. MINLPLib - A Collection of Test Models for Mixed-Iinteger Nonlinear Programming. INFORMS J. Comput., 15(1), 2003.
-
INFORMS J. Comput.
, vol.15
, Issue.1
, pp. 2003
-
-
Bussieck, M.R.1
Drud, A.S.2
Meeraus, A.3
-
6
-
-
0141689998
-
-
C. Bliek, P. Spellucci, L. Vicente, A. Neumaier, L. Granvilliers, E. Monfroy, F. Benhamou, E. Huens, P. Van Hentenryck, D. Sam-Haroud, and B. Faltings. COCONUT Deliverable D1, Algorithms for Solving Nonlinear Constrained and Optimization Problems: The State of The Art http://www.mat.univie.ac.at/ neum/glopt.html, 2001.
-
(2001)
COCONUT Deliverable D1, Algorithms for Solving Nonlinear Constrained and Optimization Problems: The State of the Art
-
-
Bliek, C.1
Spellucci, P.2
Vicente, L.3
Neumaier, A.4
Granvilliers, L.5
Monfroy, E.6
Benhamou, F.7
Huens, E.8
Van Hentenryck, P.9
Sam-Haroud, D.10
Faltings, B.11
-
7
-
-
35248829409
-
-
MINLP World
-
GAMS Development Corp. and GAMS Software GmbH. MINLP World, 2002. http://www.gamsworld.org/minlp/.
-
(2002)
GAMS Software GmbH
-
-
-
10
-
-
0003579442
-
-
Technical report, University of California, San Diego, Mathematics Department Report NA 97-4
-
P. E. Gill, W. Murray, and M. A. Saunders. SNOPT 5.3 user's guide. Technical report, University of California, San Diego, Mathematics Department Report NA 97-4, 1997.
-
(1997)
SNOPT 5.3 User's Guide
-
-
Gill, P.E.1
Murray, W.2
Saunders, M.A.3
-
13
-
-
1942539758
-
Outer Approximation Algorithms for Separable Nonconvex Mixed-Integer Nonlinear Programs
-
submitted
-
P. Kesavan, R. J. Allgor, E. P. Gatzke, and P. I. Barton. Outer Approximation Algorithms for Separable Nonconvex Mixed-Integer Nonlinear Programs, submitted to Mathematical Programming, 2001.
-
(2001)
Mathematical Programming
-
-
Kesavan, P.1
Allgor, R.J.2
Gatzke, E.P.3
Barton, P.I.4
-
16
-
-
0033134718
-
A Symbolic Reformulation/Spatial Branch and Bound Algorithm for the Global Optimization of nonconvex MINLPs
-
E. M. B. Smith and C. C. Pantelides. A Symbolic Reformulation/Spatial Branch and Bound Algorithm for the Global Optimization of nonconvex MINLPs. Computers and Chemical Engineering, 23:457-478, 1999.
-
(1999)
Computers and Chemical Engineering
, vol.23
, pp. 457-478
-
-
Smith, E.M.B.1
Pantelides, C.C.2
-
18
-
-
35248884214
-
-
Zsolt Ugray, Leon Lasdon, John Plummer, Fred Glover, Jim Kelly, and Rafael Marti. A multistart scatter search heuristic for smooth NLP and MINLP problems. http://www.utexas.edu/courses/lasdon/papers.htm, 2002.
-
(2002)
A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems
-
-
Ugray, Z.1
Lasdon, L.2
Plummer, J.3
Glover, F.4
Kelly, J.5
Marti, R.6
-
19
-
-
0007861669
-
Global optimization of nonconvex MINLP's by interval analysis
-
I. E. Grossmann, editor, Kluwer Academic Publishers
-
R. Vaidyanathan and M. EL-Halwagi. Global optimization of nonconvex MINLP's by interval analysis. In I. E. Grossmann, editor, Global Optimization in Engineering Design, pages 175-193. Kluwer Academic Publishers, 1996.
-
(1996)
Global Optimization in Engineering Design
, pp. 175-193
-
-
Vaidyanathan, R.1
El-Halwagi, M.2
|