We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
In this paper we study a general formulation of the train platforming problem, which contains as special cases all the versions previously considered in the literature as well as a...
The focus of this paper is on the set intersection problem for closed convex sets admitting projection operation in a closed form. The objective is to investigate algorithms that w...
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...