Tobias Dietz

According to our database1, Tobias Dietz authored at least 10 papers between 2018 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
The binary knapsack problem with qualitative levels.
Eur. J. Oper. Res., 2021

2020
A Reduced-Complexity Projection Algorithm for ADMM-Based LP Decoding.
IEEE Trans. Inf. Theory, 2020

An inner approximation method to compute the weight set decomposition of a triobjective mixed-integer problem.
J. Glob. Optim., 2020

Shortest paths with ordinal weights.
Eur. J. Oper. Res., 2020

Introducing multiobjective complex systems.
Eur. J. Oper. Res., 2020

The {0, 1}-knapsack problem with qualitative levels.
CoRR, 2020

Sparsifying parity-check matrices.
Appl. Soft Comput., 2020

2019
The Bicriterion Maximum Flow Network Interdiction Problem in <i>s</i>-<i>t</i>-Planar Graphs.
Proceedings of the Operations Research Proceedings 2019, 2019

2018
A Low-Complexity Projection Algorithm for ADMM-Based LP Decoding.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

Improved Maximum-Likelihood Decoding Using Sparse Parity-Check Matrices.
Proceedings of the 25th International Conference on Telecommunications, 2018


  Loading...