A novel approach to classification is proposed in which a Paretobased ranking of individuals is used to encourage multiple individuals to participate in the solution. To do so, th...
We initiate the study of the smoothed complexity of the Closest String problem by proposing a semi-random model of Hamming distance. We restrict interest to the optimization versio...
We investigate a variant of the Fixed Charge Shortest Paths problem which enumerates the sequence of optimal solutions that arise as the focus shifts from the fixed cost parameter...
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Optimality systems and their linearizations arising in optimal control of partial differential equations with pointwise control and (regularized) state constraints are considered. ...