The Steiner tree packing problem (STPP) in graphs is a long studied problem in combinatorial optimization. In contrast to many other problems, where there have been tremendous advances in practical problem solving, STPP remains very difficult. Most heuristics schemes are ineffective and even...

In the A-coloring game, two players, Alice and Bob, color uncolored vertices of a given uncolored digraph D with colors from a given color set C, so that, at any time a vertex is colored, its color has to be different from the colors of its previously colored in-neighbors. Alice begins. The...

We prove that both the nucleolus and the core-center, i.e., the mass center of the core, of an m-sided Böhm-Bawerk assignment market can be respectively computed from the nucleolus and the core-center of a convex game defined on the set of m sectors. What is more, in the calculus of the...

We consider a model for determining optimal opportunistic maintenance schedules w.r.t. a maximum replacement interval. This problem generalizes that of Dickman et al. (J Oper Res Soc India 28:165–175, <CitationRef CitationID="CR12">1991</CitationRef>) and is a natural starting point for modelling replacement schedules of more complex...</citationref>

We consider the traveling tournament problem, which is a well-known benchmark problem in tournament timetabling. It consists of designing a schedule for a sports league of n teams such that the total traveling costs of the teams are minimized. The most important variant of the traveling...

Let T = (V, E) be a tree. A core of T is a path P, for which the sum of the weighted distances from all vertices to this path is minimized. In this paper, we consider the semi-obnoxious case in which the vertices have positive or negative weights. We prove that, when the sum of the weights of...

We describe the two-to-one assignment problem, a problem in between the axial three-index assignment problem and the three-dimensional matching problem, having applications in various domains. For the (relevant) case of decomposable costs satisfying the triangle inequality we provide, on the...

We demonstrate that two key theorems of Amaldi et al. (Math Methods Oper Res 69:205–223, <CitationRef CitationID="CR1">2009</CitationRef>), which they presented with rather complicated proofs, can be more easily and cleanly established using a simple and classical property of binary matroids. Besides a simpler proof, we see that both...</citationref>

We study a two-sided singular control problem in a general linear diffusion setting and provide a set of conditions under which an optimal control exists uniquely and is of singular control type. Moreover, under these conditions the associated value function can be written in a quasi-explicit...

The aim of this paper consists of constructing accessibility measures to the nodes of directed graphs using methods of Game Theory. Since digraphs without a predefined game are considered, the main part of the paper is devoted to establish conditions on cooperative games so that they can be used...