Home Aktivitäten Mitglieder Links Registrieren Login
 
Datum Vortragende(r) Thema Kommentar(e)
    
26.01.12 S. Smriglio (Univ. L Aquila) Strong relaxations and cutting planes for the stable set problem 0
    
23.05.11 C. Dobre (Univ. Groningen) Exploiting algebraic symmetry in SDP bounds for structured combinatorial optimization problems 1
    
10.01.11 A. Yildirim (Bilkent Univ.) Core sets in optimization: a unifying framework 0
    
14.06.10 M. Overton (New York Univ.) Nonsmooth, nonconvex optimization 0
    
07.06.10 P. Amaral (Univ. Nova Lisboa) From infeasibility to copositivity 0
    
12.04.10 M. Anjos (Univ. Waterloo) Warm starts for interior-point methods in combinatorial optimization 1
    
29.06.09 A. Man-Cho So (C.Univ. Hongkong) Khintchine-type inequalities and their applications in optimization 0
    
03.11.08 H.-H.Bock (RWTH Aachen) Probabilistic models and model-based algorithms for clustering 1
    
26.05.08 S. Rota Buló (Univ.Venezia) On continuous characterizations of cliques on hypergraphs 0
  T. Terlaky (McMaster Univ.) The Hirsch conjecture and its relatives  
    
21.01.08 J. Judice (Univ.Coimbra) The eigenvalue complementarity problem 0
    
05.11.07 J. Povh (Univ. Maribor) On approximations of hard combinatorial problems by semidefinite and copositive programming 0
    
22.10.07 D.di Serafino (2a Univ.Napoli) Effective solution of the KKT system for effective large-scale optimization 1
    
19.10.07 F. Schoen (Univ. Firenze) Large scale global optimization: a survey of some recent success stories 1
    
26.03.07 A. Wiegele (Univ.Klagenfurt) Combining semidefinite and polyhedral relaxations for solving the Max-Cut problem 1
    
12.12.06 D. Hochbaum (Univ.Berkeley) Ranking sports teams, web pages, academic papers, and NSF proposals with optimization techniques 0
    
12.12.06 I. Bomze (Univ. Wien) The first cut is the cheapest - improving SDP bounds for the clique number 1
  A.Sartenaer (Univ.Namur) Recursive trust-region methods for multiscale nonlinear optimization  
    
11.12.06 K. Anstreicher (Univ.Iowa) An improved algorithm for computing Steiner minimal trees in Euclidean d-space 1
  M. Dür (TU Darmstadt) Towards solving copositive programs  
    
19.06.06 P. Tseng (Univ.Washington) SOCP Relaxation of Sensor Network Localization 1
    
29.05.06 M.Gaudioso (Univ.Cosenza) Algorithms for convex nonsmooth minimization and their extension to the nonconvex case 1
    
19.12.05 E. Carrizosa (Univ. Sevilla) Distance optimization and decision making 0
    
10.10.05 I. Dukanovic (Univ. Maribor) Strengthening Lovasz's theta number toward chromatic and clique number 0
    
20.06.05 W. Achtziger (Univ. Dortmund) On Optimization Problems with Vanishing Constraints 0
  F. Frommlet (Univ. Wien) Improving SDP bounds for minimizing quadratic functions over the $\ell^1$-ball  
    
14.03.05 P. Gritzmann (TU München) Diskrete Tomographie 0
    
31.01.05 K. Klamroth (Univ.Erlangen) Optimization with Conflicting Objectives: Applications, Models and Solution Methods 1
  G. Klau (FU Berlin) Structural Alignment of RNA Sequences with Lagrangian Relaxation  
    
15.11.04 F. Schoen (Univ. Firenze) A population-based algorithm for molecular cluster optimization 1
  B. Addis (Univ. Firenze) A trust-region algorithm for global optimization  
    
Version: 1.0.2 ImpressumKontakt
© 2004 by Daniel Bomze