Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
This paper presents a variety of different ways of estimating the general parameters for pump-curves. First a formulation is made that converts the problem into estimating four p...
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' in...