This paper introduces the ―min-additive‖ (also called ―min-average‖) utility function. This function is a weighted combination of an additive utility function and a minimization over a set of single attribute utility functions. The weighting is accomplished by exploiting information already contained in the additive and minimization models. Four forms of the min-additive (MA) model are presente...

In this work, we resolve an open problem posed by Joswig et al. [49] by providing an ̃ O(N ) time, O(log(N )) factor approximation algorithm for the min-Morse unmatched problem (MMUP) Let ⇤ be the no. of critical cells of the optimal discrete Morse function and N be the total no. of cells of a regular cell complex K. The goal of MMUP is to find ⇤ for a given K. To begin with, we apply an approx....

We model (interactive) resources that provide Alice with a string X and a guarantee that any Eve interacting with her interface of the resource obtains a (quantum) system E such that the conditional (smooth) min-entropy of X given E is lower bounded by some k, H min(X |E) ≥ k. This (abstract) resource specification encompasses any setting that results in the honest players holding such a string...

Ant System, the first Ant Colony Optimization algorithm, showed to be a viable method for attacking hard combinatorial optimization problems. Yet, its performance, when compared to more fine-tuned algorithms, was rather poor for large instances of traditional benchmark problems like the Traveling Salesman Problem. To show that Ant Colony Optimization algorithms could be good alternatives to exi...