Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGeorg Still
Person information
- affiliation: University of Twente, Enschede, Netherlands
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j29]Oskar A. L. Eikenbroek
, Georg J. Still, Eric C. Van Berkum:
Improving the performance of a traffic system by fair rerouting of travelers. Eur. J. Oper. Res. 299(1): 195-207 (2022)- 2021
- [j28]Faizan Ahmed, Georg Still:
Two methods for the maximization of homogeneous polynomials over the simplex. Comput. Optim. Appl. 80(2): 523-548 (2021) - [j27]Winfried Hochstättler, Johann L. Hurink, Bodo Manthey, Daniël Paulusma, Britta Peis, Georg Still:
In Memoriam Walter Kern. Discret. Appl. Math. 303: 2-3 (2021) - 2019
- [j26]Faizan Ahmed, Georg Still:
Maximization of Homogeneous Polynomials over the Simplex and the Sphere: Structure, Stability, and Generic Behavior. J. Optim. Theory Appl. 181(3): 972-996 (2019) - 2017
- [j25]Mirjam Dür, Bolor Jargalsaikhan, Georg Still:
Genericity Results in Linear Conic Programming - A Tour d'Horizon. Math. Oper. Res. 42(1): 77-94 (2017) - 2015
- [j24]Mirjam Dür, Bolor Jargalsaikhan, Georg Still:
First order solutions in conic programming. Math. Methods Oper. Res. 82(2): 123-142 (2015) - 2013
- [j23]Matthijs Bomhoff, Walter Kern, Georg Still:
A note on perfect partial elimination. Discret. Math. 313(14): 1558-1563 (2013) - [j22]Faizan Ahmed, Georg Still:
A note on set-semidefinite relaxations of nonconvex quadratic programs. J. Glob. Optim. 57(4): 1139-1146 (2013) - [j21]Faizan Ahmed, Mirjam Dür, Georg Still:
Copositive Programming via Semi-Infinite Optimization. J. Optim. Theory Appl. 159(2): 322-340 (2013) - [j20]Gemayqzel Bouza Allende, Georg Still:
Solving bilevel programs with the KKT-approach. Math. Program. 138(1-2): 309-332 (2013) - 2012
- [j19]Matthijs Bomhoff, Walter Kern, Georg Still:
On bounded block decomposition problems for under-specified systems of equations. J. Comput. Syst. Sci. 78(1): 336-347 (2012) - 2008
- [j18]Oliver Stein, Georg Still, Tamás Terlaky, Gerhard-Wilhelm Weber:
Editorial. Central Eur. J. Oper. Res. 16(2): 107-109 (2008) - [j17]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Some families of integral graphs. Discret. Math. 308(24): 6383-6391 (2008) - 2007
- [j16]Ligong Wang, Hajo Broersma, Cornelis Hoede, Xueliang Li, Georg Still:
Integral trees of diameter 6. Discret. Appl. Math. 155(10): 1254-1266 (2007) - [j15]S. Ilker Birbil, J. B. G. Frenk, Georg J. Still:
An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming. Eur. J. Oper. Res. 180(1): 479-484 (2007) - [j14]Marco A. López, Georg Still:
Semi-infinite programming. Eur. J. Oper. Res. 180(2): 491-518 (2007) - [j13]Gemayqzel Bouza, Georg Still:
Mathematical Programs with Complementarity Constraints: Convergence Properties of a Smoothing Method. Math. Oper. Res. 32(2): 467-483 (2007) - 2006
- [j12]S. Ilker Birbil, Gemayqzel Bouza, J. B. G. Frenk, Georg J. Still:
Equilibrium constrained optimization problems. Eur. J. Oper. Res. 169(3): 1108-1127 (2006) - [j11]Petrica C. Pop, Walter Kern, Georg Still:
A new relaxation method for the generalized minimum spanning tree problem. Eur. J. Oper. Res. 170(3): 900-908 (2006) - 2004
- [j10]Jan Brinkhuis, Tibor Illés, Hans Frenk, Georg Still, Gerhard-Wilhelm Weber, Tamás Terlaky:
International workshop on smooth and nonsmooth optimization (Rotterdam, July 12-13, 2001). Eur. J. Oper. Res. 157(1): 1-2 (2004) - 2003
- [j9]Oliver Stein, Georg Still:
Solving Semi-Infinite Optimization Problems with Interior Point Techniques. SIAM J. Control. Optim. 42(3): 769-788 (2003) - 2002
- [j8]Oliver Stein, Georg Still:
On generalized semi-infinite optimization and bilevel optimization. Eur. J. Oper. Res. 142(3): 444-462 (2002) - [j7]Georg Still:
Linear bilevel problems: Genericity results and an efficient method for computing local minima. Math. Methods Oper. Res. 55(3): 383-400 (2002) - 2001
- [j6]P. Jonker, Georg Still, F. Twilt:
One-Parametric Linear-Quadratic Optimization Problems. Ann. Oper. Res. 101(1-4): 221-253 (2001) - [j5]Petrica C. Pop, Walter Kern, Georg Still, Ulrich Faigle:
Relaxation methods for the Generalized Minimum Spanning Tree Problem. Electron. Notes Discret. Math. 8: 76-79 (2001) - [j4]Georg Still:
Discretization in semi-infinite programming: the rate of convergence. Math. Program. 91(1): 53-69 (2001) - 1999
- [j3]Georg Still:
Generalized semi-infinite programming: Theory and methods. Eur. J. Oper. Res. 119(2): 301-313 (1999) - 1997
- [j2]Georg Still, Martin Streng:
The Chebyshev Hyperplane Optimization Problem. J. Glob. Optim. 11(4): 361-376 (1997) - 1989
- [j1]Rainer Tichatschke, Rainer Hettich, Georg Still:
Connections between generalized, inexact and semi-infinite linear programming. ZOR Methods Model. Oper. Res. 33(6): 367-382 (1989)
Conference and Workshop Papers
- 2005
- [c1]Petrica C. Pop, Georg Still, Walter Kern:
An Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. ACiD 2005: 115-121
Editorship
- 2007
- [e1]Johann L. Hurink, Walter Kern, Gerhard F. Post, Georg Still:
Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, University of Twente, Enschede, The Netherlands, 29-31 May, 2007. University of Twente 2007 [contents]
Reference Works
- 2009
- [r1]Rainer Hettich, Georg Still:
Semi-infinite Programming: Second Order Optimality Conditions. Encyclopedia of Optimization 2009: 3434-3439
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-09 00:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
