Ruzika Stefan

Stefan Ruzika

Information about the author Stefan Ruzika will soon be added to the site.
Found 9 papers in total
Easy to say they are Hard, but Hard to see they are Easy– Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
Easy to say they are Hard, but Hard to see they are Easy– Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
2017
Multiobjective combinatorial optimization problems are known to be hard problems for...
Multiobjective optimization for interwoven systems
Multiobjective optimization for interwoven systems
2017
In practical situations, complex systems are often composed of subsystems or...
Multiple objective branch and bound for mixed 0‐1 linear programming: Corrections and improvements for the biobjective case
Multiple objective branch and bound for mixed 0‐1 linear programming: Corrections and improvements for the biobjective case
2013
This work addresses the correction and improvement of Mavrotas and Diakoulaki's branch...
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization
2011
Connectedness of efficient solutions is a powerful property in multiple objective...
On k-max-optimization
On k-max-optimization
2009
We generalize bottleneck objectives in combinatorial optimization by minimizing the k...
Multiple objective minimum cost flow problems: A review
Multiple objective minimum cost flow problems: A review
2007
In this paper, theory and algorithms for solving the multiple objective minimum cost...
Finding representative systems for discrete bicriterion optimization problems
Finding representative systems for discrete bicriterion optimization problems
2007
Given a discrete bicriterion optimization problem, we propose two box algorithms to...
Algorithms for time-dependent bicriteria shortest path problems
Algorithms for time-dependent bicriteria shortest path problems
2006
In this paper we generalize the classical shortest path problem in two ways. We...
Detecting local convexity on the Pareto surface
Detecting local convexity on the Pareto surface
2002
Recent regain in interest in multi-criteria optimization approaches to provide a...
Papers per page: