Georg Still

Affiliations:
  • University of Twente, Enschede, Netherlands


According to our database1, Georg Still authored at least 31 papers between 1989 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Improving the performance of a traffic system by fair rerouting of travelers.
Eur. J. Oper. Res., 2022

2021
In Memoriam Walter Kern.
Discret. Appl. Math., 2021

Two methods for the maximization of homogeneous polynomials over the simplex.
Comput. Optim. Appl., 2021

2019
Maximization of Homogeneous Polynomials over the Simplex and the Sphere: Structure, Stability, and Generic Behavior.
J. Optim. Theory Appl., 2019

2017
Genericity Results in Linear Conic Programming - A Tour d'Horizon.
Math. Oper. Res., 2017

2015
First order solutions in conic programming.
Math. Methods Oper. Res., 2015

2013
Solving bilevel programs with the KKT-approach.
Math. Program., 2013

Copositive Programming via Semi-Infinite Optimization.
J. Optim. Theory Appl., 2013

A note on set-semidefinite relaxations of nonconvex quadratic programs.
J. Glob. Optim., 2013

A note on perfect partial elimination.
Discret. Math., 2013

2012
On bounded block decomposition problems for under-specified systems of equations.
J. Comput. Syst. Sci., 2012

2009
Semi-infinite Programming: Second Order Optimality Conditions.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2008
Some families of integral graphs.
Discret. Math., 2008

Editorial.
Central Eur. J. Oper. Res., 2008

2007
Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method.
Math. Oper. Res., 2007

Semi-infinite programming.
Eur. J. Oper. Res., 2007

An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming.
Eur. J. Oper. Res., 2007

Integral trees of diameter 6.
Discret. Appl. Math., 2007

2006
A new relaxation method for the generalized minimum spanning tree problem.
Eur. J. Oper. Res., 2006

Equilibrium constrained optimization problems.
Eur. J. Oper. Res., 2006

2005
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size.
Proceedings of the Algorithms and Complexity in Durham 2005, 2005

2004
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001).
Eur. J. Oper. Res., 2004

2003
Solving Semi-Infinite Optimization Problems with Interior Point Techniques.
SIAM J. Control. Optim., 2003

2002
Linear bilevel problems: Genericity results and an efficient method for computing local minima.
Math. Methods Oper. Res., 2002

On generalized semi-infinite optimization and bilevel optimization.
Eur. J. Oper. Res., 2002

2001
Discretization in semi-infinite programming: the rate of convergence.
Math. Program., 2001

Relaxation methods for the Generalized Minimum Spanning Tree Problem.
Electron. Notes Discret. Math., 2001

One-Parametric Linear-Quadratic Optimization Problems.
Ann. Oper. Res., 2001

1999
Generalized semi-infinite programming: Theory and methods.
Eur. J. Oper. Res., 1999

1997
The Chebyshev Hyperplane Optimization Problem.
J. Glob. Optim., 1997

1989
Connections between generalized, inexact and semi-infinite linear programming.
ZOR Methods Model. Oper. Res., 1989


  Loading...