umn logo IMA home |  Contact IMA 
IMA Web
Featured Videos:
Möbius Transformations Revealed Math and Science are all around us
(from ExxonMobil) 		Math and Science are everywhere
(from ExxonMobil)


Searching Results for SW11.17-21.08:
Building an effective solver for convex mixed integer nonlinear programs, Jeff Linderoth  (University of Wisconsin)
Branching strategies and heurisitcs in a branch-and-bound for convex MINLPs, Pierre Bonami  (Centre National de la Recherche Scientifique (CNRS))
Branching rules in branch-and-bound algorithms for nonconvex mixed-integer nonlinear programming, Pietro Belotti  (Lehigh University)
Fast infeasibility detection in nonlinear optimization, Jorge Nocedal  (Northwestern Universit)
Using interior-point methods within MINLP, Hande Yurttan Benson  (Drexel University))
Discussion, Sven Leyffer  (Argonne National Laboratory)
Copositive programming and combinatorial optimization, Franz F. Rendl  (Universität Klagenfurt)
The difference between 5x5 doubly nonnegative and completely positive matrices, Kurt M. Anstreicher  (University of Iowa)
Convex relaxations of non-convex MIQCP, Anureet Saxena  (Axioma Inc.)
A branch-and-refine method for nonconvex mixed integer optimization, Annick Sartenaer  (Facultés Universitaires Notre Dame de la Paix (Namur))
Reformulations in mathematical programming: Symmetry, Leo Liberti  (École Polytechnique)
Discussion, Francois Margot  (Carnegie Mellon University)
What's new in SQP methods?, Philip E. Gill  (University of California, San Diego)
Global optimization of MINLP problems containing signomial functions, Tapio Westerlund  (Åbo Akademi (Finland-Swedish University of Åbo)
A local relaxation approach for the siting of electrical substations, Uday V. Shanbhag  (University of Illinois at Urbana-Champaign)
A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem, Christoph Helmberg  (echnische Universität Chemnitz-Zwickau)
Using expression graphs in optimization algorithms, David M. Gay  (Sandia National Laboratories)
Discussion, Tamás Terlaky  (Lehigh University)
Preprocessing techniques for discrete optimization problems, Todd S. Munson  (Argonne National Laboratory)
Nonlinear discrete optimization I, Robert Weismantel  (Otto-von-Guericke-Universität Magdeburg)
Nonlinear discrete optimization II, Shmuel Onn  (Technion-Israel Institute of Technology)
On the foundations of the theory of non-Linear and multi-objective integer optimization, Jesus Antonio De Loera  (University of California, Davis)
Parallelization issues for MINLP Part I, William E. Hart  (Sandia National Laboratories)
Parallelization issues for MINLP Part II, Cynthia A. Phillips  (Sandia National Laboratories)
MINLP application for optimizing sourcing decisions in a distressed supplier environment, Erica Zimmer Klampfl  (Ford)
Discussion, Jon Lee  (IBM)
Generalized disjunctive programming: A framework for formulation and alternative algorithms for MINLP optimization, Ignacio E. Grossmann  (Carnegie Mellon University)
Mixed integer second order cone programming, Sarah Drewes  (TU Darmstadt)
Solving nonconvex MINLP by quadratic approximation, Stefan Vigerske  (Humboldt-Universität)
Nonlinear optimization via summation and integration, Matthias Koeppe  (University of California, Davis)
From the stable set problem to convex algebraic geometry, Pablo A. Parrilo  (Massachusetts Institute of Technology)
Discussion, Tapio Westerlund  (Åbo Akademi (Finland-Swedish University of Åbo))
©2006 Regents of the University of Minnesota. All rights reserved.
The University of Minnesota is an equal opportunity educator and employer.
Trouble seeing the text? | Contact U of M | Privacy
Last modified on