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â€¦ (More)

This work addresses the correction and improvement of Mavrotas and Diakoulakiâ€™s branch and bound algorithm for mixed 0-1 MOLP. We first develop about the issues encountered by the original algorithmâ€¦ (More)

In this paper we generalize the classical shortest path problem in two ways. We consider two objective functions and timedependent data. The resulting problem, called the time-dependent bicriteriaâ€¦ (More)

We consider multiple objective combinatorial optimization problems in which the first objective is of arbitrary type and the remaining objectives are either bottleneck or k-max objective functions.â€¦ (More)

Abstract. A new algorithm for optimization problems with three objective functions is presented which computes a representation for the set of nondominated points. This representation is guaranteedâ€¦ (More)

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â€¦ (More)