Stefan Ruzika

According to our database1, Stefan Ruzika authored at least 53 papers between 2006 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
On the hardness of covering-interdiction problems.
Theor. Comput. Sci., 2021

One-exact approximate Pareto sets.
J. Glob. Optim., 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

On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem.
Math. Methods Oper. Res., 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

On the Bicriterion Maximum Flow Network Interdiction Problem.
CoRR, 2020

The two player shortest path network interdiction problem.
CoRR, 2020

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

On the <i>p</i>-hub interdiction problem.
Comput. Oper. Res., 2020

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

2019
The Power of the Weighted Sum Scalarization for Approximating Multiobjective Optimization Problems.
CoRR, 2019

On the Universal Near-Shortest Simple Paths Problem.
CoRR, 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

An FPTAS for a General Class of Parametric Optimization Problems.
Proceedings of the Computing and Combinatorics - 25th International Conference, 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

2017
A general approximation method for bicriteria minimization problems.
Theor. Comput. Sci., 2017

Shortest Paths with Shortest Detours - A Biobjective Routing Problem.
J. Optim. Theory Appl., 2017

A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions.
J. Glob. Optim., 2017

Approximation schemes for the parametric knapsack problem.
Inf. Process. Lett., 2017

On a Technique for Finding Running Tracks of Specific Length in a Road Network.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
Evacuation modeling: a case study on linear and nonlinear network flow models.
EURO J. Comput. Optim., 2016

Hypervolume Subset Selection in Two Dimensions: Formulations and Algorithms.
Evol. Comput., 2016

ADMM versus simplex algorithm for LP decoding.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

2014
A simplex algorithm for LP decoding hardware.
Proceedings of the 25th IEEE Annual International Symposium on Personal, 2014

Efficient maximum-likelihood decoding of linear block codes on binary memoryless channels.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Towards An Exact Combinatorial Algorithm for LP Decoding of Turbo Codes
CoRR, 2013

Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case.
Comput. Oper. Res., 2013

Towards combinatorial LP turbo decoding.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012
Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms.
IEEE Trans. Inf. Theory, 2012

Generalized multiple objective bottleneck problems.
Oper. Res. Lett., 2012

Min-Max quickest path problems.
Networks, 2012

Committee selection under weight constraints.
Math. Soc. Sci., 2012

ML vs. BP decoding of binary and non-binary LDPC codes.
Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

2011
Evacuation dynamics influenced by spreading hazardous material.
Networks Heterog. Media, 2011

Earliest arrival flows on series-parallel graphs.
Networks, 2011

Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization.
J. Optim. Theory Appl., 2011

Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithm
CoRR, 2011

Reliable and Restricted Quickest Path Problems.
Proceedings of the Network Optimization - 5th International Conference, 2011

Quickest Cluster Flow Problems on Tree Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A separation algorithm for improved LP-decoding of linear block codes.
IEEE Trans. Inf. Theory, 2010

Numerical Comparison of IP Formulations as ML Decoders.
Proceedings of IEEE International Conference on Communications, 2010

2009
On k-max-optimization.
Oper. Res. Lett., 2009

Valid inequalities for binary linear codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

A Survey on Multiple Objective Minimum Spanning Tree Problems.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

Committee Selection with a Weight Constraint Based on Lexicographic Rankings of Individuals.
Proceedings of the Algorithmic Decision Theory, First International Conference, 2009

2007
Finding representative systems for discrete bicriterion optimization problems.
Oper. Res. Lett., 2007

Multiple objective minimum cost flow problems: A review.
Eur. J. Oper. Res., 2007

2006
An Exact Algorithm for Solving Weight-Constrained Combinatorial Optimization Problems.
Electron. Notes Discret. Math., 2006

Algorithms for time-dependent bicriteria shortest path problems.
Discret. Optim., 2006


  Loading...