default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernd Zey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2017
[b1]Bernd Zey
:
Solving two-stage stochastic network design problems to optimality. Dortmund University, Germany, 2017
Journal Articles
- 2021
- [j5]Daniel R. Schmidt, Bernd Zey, François Margot:
Stronger MIP formulations for the Steiner forest problem. Math. Program. 186(1): 373-407 (2021) - [j4]Daniel R. Schmidt, Bernd Zey, François Margot:
Correction to: Stronger MIP formulations for the Steiner forest problem. Math. Program. 188(1): 409-410 (2021) - 2017
- [j3]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic survivable network design problems: Theory and practice. Eur. J. Oper. Res. 256(2): 333-348 (2017) - 2013
- [j2]Ivana Ljubic, Petra Mutzel, Bernd Zey:
Stochastic Survivable Network Design Problems. Electron. Notes Discret. Math. 41: 245-252 (2013) - 2012
- [j1]Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner tree algorithms for bounded treewidth. J. Discrete Algorithms 16: 67-78 (2012)
Conference and Workshop Papers
- 2018
- [c6]Daniel R. Schmidt, Bernd Zey, François Margot:
An Exact Algorithm for the Steiner Forest Problem. ESA 2018: 70:1-70:14 - 2012
- [c5]Denis Kurz, Petra Mutzel, Bernd Zey:
Parameterized Algorithms for Stochastic Steiner Tree Problems. MEMICS 2012: 143-154 - 2011
- [c4]Markus Chimani, Petra Mutzel, Bernd Zey:
Improved Steiner Tree Algorithms for Bounded Treewidth. IWOCA 2011: 374-386 - 2010
- [c3]Immanuel M. Bomze, Markus Chimani, Michael Jünger, Ivana Ljubic, Petra Mutzel, Bernd Zey:
Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch-and-Cut. ISAAC (1) 2010: 427-439 - 2009
- [c2]Carsten Gutwenger, Petra Mutzel, Bernd Zey:
On the Hardness and Approximability of Planar Biconnectivity Augmentation. COCOON 2009: 249-257 - [c1]Carsten Gutwenger, Petra Mutzel, Bernd Zey:
Planar Biconnectivity Augmentation with Fixed Embedding. IWOCA 2009: 289-300
Informal and Other Publications
- 2017
- [i2]Daniel R. Schmidt, Bernd Zey, François Margot:
MIP Formulations for the Steiner Forest Problem. CoRR abs/1709.01124 (2017) - 2016
- [i1]Bernd Zey:
ILP formulations for the two-stage stochastic Steiner tree problem. CoRR abs/1611.04324 (2016)
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 2025-02-12 01:09 CET 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:
