default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTobias Dietz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j6]Luca E. Schäfer
, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika:
The binary knapsack problem with qualitative levels. Eur. J. Oper. Res. 289(2): 508-514 (2021)- 2020
- [j5]Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika:
Sparsifying parity-check matrices. Appl. Soft Comput. 96: 106601 (2020) - [j4]Tobias Dietz, Kathrin Klamroth, Konstantin Kraus, Stefan Ruzika, Luca E. Schäfer, Britta Schulze, Michael Stiglmayr, Margaret M. Wiecek:
Introducing multiobjective complex systems. Eur. J. Oper. Res. 280(2): 581-596 (2020) - [j3]Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich, Stefan Ruzika, José Rui Figueira:
Shortest paths with ordinal weights. Eur. J. Oper. Res. 280(3): 1160-1170 (2020) - [j2]Pascal Halffmann, Tobias Dietz, Anthony Przybylski, Stefan Ruzika:
An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem. J. Glob. Optim. 77(4): 715-742 (2020) - [j1]Florian Gensheimer, Tobias Dietz, Kira Kraft, Stefan Ruzika, Norbert Wehn:
A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding. IEEE Trans. Inf. Theory 66(8): 4819-4833 (2020) - [i4]Luca E. Schäfer, Tobias Dietz, Maria Barbati, José Rui Figueira, Salvatore Greco, Stefan Ruzika:
The {0, 1}-knapsack problem with qualitative levels. CoRR abs/2002.04850 (2020) - [i3]Luís M. S. Russo, Tobias Dietz, José Rui Figueira, Alexandre P. Francisco, Stefan Ruzika:
Sparsifying Parity-Check Matrices. CoRR abs/2005.05051 (2020)
2010 – 2019
- 2019
- [c3]Luca E. Schäfer, Tobias Dietz, Marco V. Natale, Stefan Ruzika, Sven O. Krumke, Carlos M. Fonseca:
The Bicriterion Maximum Flow Network Interdiction Problem in s-t-Planar Graphs. OR 2019: 133-139 - [i2]Florian Gensheimer, Tobias Dietz, Kira Kraft, Stefan Ruzika, Norbert Wehn:
A Reduced-Complexity Projection Algorithm for ADMM-based LP Decoding. CoRR abs/1901.03240 (2019) - 2018
- [c2]Florian Gensheimer, Tobias Dietz, Stefan Ruzika, Kira Kraft, Norbert Wehn:
Improved Maximum-Likelihood Decoding Using Sparse Parity-Check Matrices. ICT 2018: 236-240 - [c1]Florian Gensheimer, Tobias Dietz, Stefan Ruzika, Kira Kraft, Norbert Wehn:
A Low-Complexity Projection Algorithm for ADMM-Based LP Decoding. ISTC 2018: 1-5 - [i1]Luca E. Schäfer, Tobias Dietz, Nicolas Fröhlich, Stefan Ruzika, José Rui Figueira:
Shortest Paths with Ordinal Weights. CoRR abs/1808.09410 (2018)
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 22:21 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:
