default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Vigerske
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j15]Ksenia Bestuzheva
, Ambros M. Gleixner, Stefan Vigerske:
A computational study of perspective cuts. Math. Program. Comput. 15(4): 703-731 (2023)- [j14]Ksenia Bestuzheva, Mathieu Besançon, Weikun Chen, Antonia Chmiela, Tim Donkiewicz, Jasper van Doornmalen, Leon Eifler, Oliver Gaul, Gerald Gamrath, Ambros M. Gleixner, Leona Gottwald, Christoph Graczyk, Katrin Halbig, Alexander Hoen, Christopher Hojny, Rolf van der Hulst, Thorsten Koch, Marco E. Lübbecke, Stephen J. Maher, Frederic Matter, Erik Mühmer, Benjamin Müller, Marc E. Pfetsch, Daniel Rehfeldt, Steffan Schlein, Franziska Schlösser, Felipe Serrano, Yuji Shinano, Boro Sofranac, Mark Turner, Stefan Vigerske, Fabian Wegscheider, Philipp Wellner, Dieter Weninger, Jakob Witzig:
Enabling Research through the SCIP Optimization Suite 8.0. ACM Trans. Math. Softw. 49(2): 22:1-22:21 (2023) - 2020
- [j13]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in n-space: missing proofs. Optim. Lett. 14(2): 409-415 (2020) - [j12]David E. Bernal, Stefan Vigerske, Francisco Trespalacios, Ignacio E. Grossmann:
Improving the performance of DICOPT in convex MINLP problems using a feasibility pump. Optim. Methods Softw. 35(1): 171-190 (2020)
2010 – 2019
- 2019
- [j11]Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele:
QPLIB: a library of quadratic programming instances. Math. Program. Comput. 11(2): 237-265 (2019) - 2018
- [j10]Yuji Shinano, Stefan Heinz, Stefan Vigerske, Michael Winkler:
FiberSCIP - A Shared Memory Parallelization of SCIP. INFORMS J. Comput. 30(1): 11-30 (2018) - [j9]Stefan Vigerske, Ambros M. Gleixner:
SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3): 563-593 (2018) - 2017
- [c6]Benjamin Müller, Renke Kuhlmann, Stefan Vigerske:
On the Performance of NLP Solvers Within Global MINLP Solvers. OR 2017: 633-639 - 2015
- [j8]Marc E. Pfetsch, Armin Fügenschuh, Björn Geißler, Nina Geißler, Ralf Gollmer, Benjamin Hiller, Jesco Humpola, Thorsten Koch, Thomas Lehmann, Alexander Martin, Antonio Morsi, Jessica Rövekamp, Lars Schewe, Martin Schmidt, Rüdiger Schultz, Robert Schwarz, Jonas Schweiger, Claudia Stangl, Marc Christian Steinbach, Stefan Vigerske, Bernhard M. Willert:
Validation of nominations in gas network optimization: models, methods, and solutions. Optim. Methods Softw. 30(1): 15-53 (2015) - [c5]Claudia D'Ambrosio, Marcia Fampa, Jon Lee, Stefan Vigerske:
On a Nonconvex MINLP Formulation of the Euclidean Steiner Tree Problem in n-Space. SEA 2015: 122-133 - 2014
- [j7]Michael R. Bussieck, Steven P. Dirkse, Stefan Vigerske:
PAVER 2.0: an open source environment for automated performance analysis of benchmarking data. J. Glob. Optim. 59(2-3): 259-275 (2014) - 2011
- [j6]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. SIAM J. Comput. 40(3): 721-769 (2011) - 2010
- [j5]Turang Ahadi-Oskui, Stefan Vigerske, Ivo Nowak, George Tsatsaronis:
Optimizing the design of complex energy conversion systems by Branch and Cut. Comput. Chem. Eng. 34(8): 1226-1236 (2010) - [c4]Winfried Neun, Thomas Sturm, Stefan Vigerske:
Supporting Global Numerical Optimization of Rational Functions by Generic Symbolic Convexity Tests. CASC 2010: 205-219 - [i1]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Boltzmann Samplers, Pólya Theory, and Cycle Pointing. CoRR abs/1003.4546 (2010)
2000 – 2009
- 2009
- [c3]Andreas Bley, Ambros M. Gleixner, Thorsten Koch, Stefan Vigerske:
Comparing MIQCP Solvers to a Specialised Algorithm for Mine Production Scheduling. HPSC 2009: 25-39 - 2008
- [j4]Ivo Nowak, Stefan Vigerske:
LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs. Central Eur. J. Oper. Res. 16(2): 127-138 (2008) - [j3]Werner Römisch, Stefan Vigerske:
Quantitative stability of fully random mixed-integer two-stage stochastic programs. Optim. Lett. 2(3): 377-388 (2008) - 2007
- [j2]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
Enumeration and Asymptotic Properties of Unlabeled Outerplanar Graphs. Electron. J. Comb. 14(1) (2007) - [j1]Stefan Vigerske, Ivo Nowak:
Adaptive discretization of convex multistage stochastic programs. Math. Methods Oper. Res. 65(2): 361-383 (2007) - [c2]Manuel Bodirsky, Éric Fusy, Mihyun Kang, Stefan Vigerske:
An unbiased pointing operator for unlabeled structures, with applications to counting and sampling. SODA 2007: 356-365 - 2002
- [c1]Ivo Nowak, Hernán Alperin, Stefan Vigerske:
LaGO - An Object Oriented Library for Solving MINLPs. COCOS 2002: 32-42
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-10-07 21:25 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:
