source: html/bib.html @ 1586

Last change on this file since 1586 was 1586, checked in by pbonami, 10 years ago

Two typos in links

File size: 7.9 KB
Line 
1<!DOCTYPE html PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" 
2  "http://www.w3.org/TR/html4/loose.dtd"> 
3<html > 
4<head><title></title> 
5<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> 
6<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)"> 
7<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)"> 
8<!-- html --> 
9<meta name="src" content="tmp.tex"> 
10<meta name="date" content="2010-01-23 16:47:00"> 
11<link rel="stylesheet" type="text/css" href="bonmin.css"> 
12</head><body 
13>
14<!--l. 1--><p class="noindent" ><div id="header">   <h1 id="siteName"><TT> <big> BONMIN </big> </tt> Users' Manual</h1>   <div id="globalNav">   <a href="Intro.html">Introduction</a> |   <a href="Obtain.html">Download</a> |  <a href="Install.html">Install</a> |   <a href="use.html">Use</a> |   <a href="options_set.html">Setting Options</a> |   <a href="options_list.html">Options List</a> |   <a href="bib.html">Bibliography</a> |  </div>   </div>  <div id="leftPanel"> <div id="side-bar">  <ul> <li class="main"><a href="/Bonmin/index.html">Bonmin</a></li>  <li><a href="https://projects.coin-or.org/Bonmin">Wiki</a></li>   <li><a href="http://neos.mcs.anl.gov/neos/solvers/minco:Bonmin/AMPL.html"> NEOS </a> </li>  <li><a href="http://egon.cheme.cmu.edu/ibm/page.htm">IBM-CMU OCR </a></li>  <li><a href="http://domino.research.ibm.com/comm/research_projects.nsf/pages/minlp.index.html">  IBM MINLP </a></li>  <br>  <br>  <li class="main"><a href="/index.html">COIN-OR Home</a></li>  <li><a href="/projects.html">Projects</a></li>  <li><a href="/faqs.html">FAQs</a></li>   <li><a href="/download.html">Download</a></li>  <li><a href="/mail.html">Mailing Lists</a></li>  <li><a href="/how-to-help.html">Get Involved</a></li>  <li><a href="/resources.html">Related Resources</a></li>  <li class="main"><a href="/foundation.html">  <br>  <br>  COIN-OR Foundation  </a></li>   <li><a href="/events.html">Events</a></li>  <li><a href="/members.html">Members</a></li>  </ul>  </div> </div> <!--end navBar div -->  <br>    </div> 
15<a 
16 id="likesection.1"></a>
17   <h3 class="likesectionHead"><a 
18 id="x1-1000"></a>References</h3>
19    <div class="thebibliography">
20    <p class="bibitem" ><span class="biblabel">
21  [1]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
22 id="cite.abhishek.leyffer.linderoth:06"></a><a 
23 id="Xabhishek.leyffer.linderoth:06"></a>K.&#x00A0;Abhishek,   S.&#x00A0;Leyffer,   and   J.&#x00A0;T.   Linderoth.   FilMINT:   An
24    outer-approximation-based solver for nonlinear mixed integer programs.
25    Preprint  ANL/MCS-P1374-0906,  Mathematics  and  Computer  Science
26    Division, Argonne National Laboratory, 2006.
27    </p>
28    <p class="bibitem" ><span class="biblabel">
29  [2]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
30 id="cite.Betal"></a><a 
31 id="XBetal"></a>P.&#x00A0;Bonami,  A.&#x00A0;Wächter,  L.T.&#x00A0;Biegler,  A.R.&#x00A0;Conn,  G.&#x00A0;Cornuéjols,
32    I.E.&#x00A0;Grossmann, C.D.&#x00A0;Laird, J.&#x00A0;Lee, A.&#x00A0;Lodi, F.&#x00A0;Margot and N.&#x00A0;Sawaya.
33    An algorithmic framework for convex mixed integer nonlinear programs.
34    <span 
35class="cmti-10">Discrete Optimization </span>5:186&#8211;204, 2008.
36    </p>
37    <p class="bibitem" ><span class="biblabel">
38  [3]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
39 id="cite.bonami.etal:06"></a><a 
40 id="Xbonami.etal:06"></a>P.&#x00A0;Bonami,  G.&#x00A0;Cornuéjols,  A.&#x00A0;Lodi,  and  F.&#x00A0;Margot.  A  feasibility
41    pump for mixed integer nonlinear programs. <span 
42class="cmti-10">Mathematical Programming</span>,
43    119 (2009), pp.&#x00A0;331&#8211;352.
44    </p>
45    <p class="bibitem" ><span class="biblabel">
46  [4]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
47 id="cite.bonami.goncalves:08"></a><a 
48 id="Xbonami.goncalves:08"></a>P.&#x00A0;Bonami  and  J.&#x00A0;Gonçalves.  Primal  heuristics  for  mixed  integer
49    nonlinear programs. Research Report, IBM T. J. Watson Research Center,
50    Yorktown, USA, September 2008.
51    </p>
52    <p class="bibitem" ><span class="biblabel">
53  [5]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
54 id="cite.hot:2009"></a><a 
55 id="Xhot:2009"></a>P.  Bonami,  M.&#x00A0;K<img 
56src="cmr10-10.png" alt="i" class="10x-x-10" />l<img 
57src="cmr10-10.png" alt="i" class="10x-x-10" />nç  and  J.&#x00A0;Linderoth.  Algorithms  and  Software
58    for Convex Mixed Integer Nonlinear Programs. Technical Report #1664,
59    Computer Sciences Department, University of Wisconsin-Madison, 2009.
60    </p>
61    <p class="bibitem" ><span class="biblabel">
62  [6]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
63 id="cite.DG"></a><a 
64 id="XDG"></a>M.&#x00A0;Duran and I.E.&#x00A0;Grossmann. An outer-approximation algorithm for
65    a class of mixed-integer nonlinear programs.  <span 
66class="cmti-10">Mathematical Programming</span>,
67    36:307&#8211;339, 1986.
68
69    </p>
70    <p class="bibitem" ><span class="biblabel">
71  [7]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
72 id="cite.Gupta80Nonlinear"></a><a 
73 id="XGupta80Nonlinear"></a>O.K.&#x00A0;Gupta  and  V.&#x00A0;Ravindran.    Branch  and  bound  experiments
74    in   convex   nonlinear   integer   programming.      <span 
75class="cmti-10">Management  Science</span>,
76    31:1533&#8211;1546, 1985.
77    </p>
78    <p class="bibitem" ><span class="biblabel">
79  [8]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
80 id="cite.FL"></a><a 
81 id="XFL"></a>R.&#x00A0;Fletcher and S.&#x00A0;Leyffer. Solving mixed integer nonlinear programs
82    by outer approximation. <span 
83class="cmti-10">Mathematical Programming</span>, 66:327&#8211;349, 1994.
84    </p>
85    <p class="bibitem" ><span class="biblabel">
86  [9]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
87 id="cite.FiLter"></a><a 
88 id="XFiLter"></a>R.&#x00A0;Fletcher and S.&#x00A0;Leyffer.  User manual for filterSQP.  <span 
89class="cmti-10">University of</span>
90    <span 
91class="cmti-10">Dundee Numerical Analysis Report NA-181</span>, 1998.
92    </p>
93    <p class="bibitem" ><span class="biblabel">
94 [10]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
95 id="cite.Gay"></a><a 
96 id="XGay"></a>D.M.&#x00A0;Gay.  Writing <span 
97class="cmbx-10">.nl </span>files.  Sandia National Laboratories, Technical
98    Report No. 2005-7907P, 2005.
99    </p>
100    <p class="bibitem" ><span class="biblabel">
101 [11]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
102 id="cite.QG"></a><a 
103 id="XQG"></a>I.&#x00A0;Quesada and I.E.&#x00A0;Grossmann.   An LP/NLP based branched and
104    bound algorithm for convex MINLP optimization problems.  <span 
105class="cmti-10">Computers</span>
106    <span 
107class="cmti-10">and Chemical Engineering</span>, 16:937&#8211;947, 1992.
108    </p>
109    <p class="bibitem" ><span class="biblabel">
110 [12]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
111 id="cite.AMPL"></a><a 
112 id="XAMPL"></a>R.&#x00A0;Fourer and D.M.&#x00A0;Gay and B.W.&#x00A0;Kernighan.  AMPL: A Modeling
113    Language for Mathematical Programming, Second Edition, Duxbury Press
114    Brooks Cole Publishing Co., 2003.
115    </p>
116    <p class="bibitem" ><span class="biblabel">
117 [13]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
118 id="cite.NocedalAdaptive"></a><a 
119 id="XNocedalAdaptive"></a>J.&#x00A0;Nocedal, A.&#x00A0;Wächter, and R.&#x00A0;A. Waltz. Adaptive Barrier Strategies
120    for Nonlinear Interior Methods.  Research Report RC 23563, IBM T. J.
121    Watson Research Center, Yorktown, USA (March 2005; revised January
122    2006)
123    </p>
124    <p class="bibitem" ><span class="biblabel">
125 [14]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
126 id="cite.AndreasIpopt"></a><a 
127 id="XAndreasIpopt"></a>A.&#x00A0;Wächter  and  L.&#x00A0;T.&#x00A0;Biegler.      On  the  Implementation  of  a
128    Primal-Dual Interior Point Filter Line Search Algorithm for Large-Scale
129    Nonlinear Programming.  Mathematical Programming 106(1), pp. 25-57,
130    2006</p></div>
131   
132</body></html> 
133
134
135
Note: See TracBrowser for help on using the repository browser.