Stefan Ruzika

Finding representative systems for discrete bicriterion optimization problems

Given a discrete bicriterion optimization problem, we propose two box algorithms to compute a finite representative system for the non-dominated set satisfying a number of quality features. Its cardinality N and the accuracy @D satisfy the relation O(A/@D), where A is the area of a starting box defined by the ideal and the nadir point.

Multiple Objective Minimum Cost Flow Problems: A Review

In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions summarizes corresponding results. The reference list consists of all papers known to the authors which deal with the multiple objective minimum cost flow problem.

Multiple objective branch and bound for mixed 0-1 linear programming

This work addresses the correction and improvement of Mavrotas and Diakoulakis branch and bound algorithm for mixed 0-1 multiple objective linear programs. We first elaborate the issues encountered by the original algorithm and then propose a corrected version for the biobjective case using an exact representation of the nondominated set associated with an appropriate update procedure. Then we introduce several improvements using better bound sets and branching strategies and finally present some experiments to study the effectiveness of our propositions.

A Separation Algorithm for Improved LP-Decoding of Linear Block Codes

Maximum likelihood (ML) decoding is the optimal decoding algorithm for arbitrary linear block codes and can be written as an integer programming (IP) problem. Feldman relaxed this IP problem and presented linear programming (LP) based decoding. In this paper, we propose a new separation algorithm to improve the error-correcting performance of LP decoding for binary linear block codes. We use an IP formulation with indicator variables that help in detecting the violated parity checks. We derive Gomory cuts from the IP and use them in our separation algorithm. An efficient method of finding cuts induced by redundant parity checks (RPC) is also proposed. Under certain circumstances we can guarantee that these RPC cuts are valid and cut off the fractional optimal solutions of LP decoding. It is demonstrated on three LDPC codes and two BCH codes that our separation algorithm performs significantly better than LP decoding and belief propagation (BP) decoding.

Algorithms for time-dependent bicriteria shortest path problems

In this paper we generalize the classical shortest path problem in two ways. We consider two objective functions and time-dependent data. The resulting problem, called the time-dependent bicriteria shortest path problem (TdBiSP), has several interesting practical applications, but has not gained much attention in the literature.

A Survey on Multiple Objective Minimum Spanning Tree Problems

We review the literature on minimum spanning tree problems with two or more objective functions (MOST) each of which is of the sum or bottleneck type. Theoretical aspects of different types of this problem are summarized and available algorithms are categorized and explained. The paper includes a concise tabular presentation of all the reviewed papers.

Mathematical Programming Decoding of Binary Linear Codes: Theory and Algorithms

Mathematical programming is a branch of applied mathematics and has recently been used to derive new decoding approaches, challenging established but often heuristic algorithms based on iterative message passing. Concepts from mathematical programming used in the context of decoding include linear, integer, and nonlinear programming, network flows, notions of duality as well as matroid and polyhedral theory. This paper reviews and categorizes decoding methods based on mathematical programming approaches for binary linear codes over binary-input memoryless symmetric channels.

Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization

Connectedness of efficient solutions is a powerful property in multiple objective combinatorial optimization since it allows the construction of the complete efficient set using neighborhood search techniques. However, we show that many classical multiple objective combinatorial optimization problems do not possess the connectedness property in general, including, among others, knapsack problems (and even several special cases) and linear assignment problems. We also extend known non-connectedness results for several optimization problems on graphs like shortest path, spanning tree and minimum cost flow problems. Different concepts of connectedness are discussed in a formal setting, and numerical tests are performed for two variants of the knapsack problem to analyze the likelihood with which non-connected adjacency graphs occur in randomly generated instances.

Generalized multiple objective bottleneck problems

Abstract We consider multiple objective combinatorial optimization problems where one objective is of arbitrary type and the remaining objectives are bottleneck or k-max objectives. An efficient algorithm for the generation of the complete non-dominated set is developed, which implies polynomial time algorithms for shortest paths, spanning tree, and assignment problems, among others.

Evacuation dynamics influenced by spreading hazardous material

In this article, an evacuation model describing the egress in case of danger is considered. The underlying evacuation model is based on continuous network flows, while the spread of some gaseous hazardous material relies on an advection-diffusion equation. The contribution of this work is twofold. First, we introduce a continuous model coupled to the propagation of hazardous material where special cost functions allow for incorporating the predicted spread into an optimal planning of the egress. Optimality can thereby be understood with respect to two different measures: fastest egress and safest evacuation. Since this modeling approach leads to a pde/ode-restricted optimization problem, the continuous model is transferred into a discrete network flow model under some linearity assumptions. Second, it is demonstrated that this reformulation results in an efficient algorithm always leading to the global optimum. A computational case study shows benefits and drawbacks of the models for different evacuation scenarios.