This paper develops a method for solving the single product multi-period production-planning problem, in which the production and the inventory costs of each period arc concave and backlogging is not permitted. It is also assumed that the unit variable cost of the production evolves according to a continuous time Markov process. We prove that this production-planning problem can be Stated as a ...

Antonios Tzimas was once told that his greatest strength the passion and commitment he applied to work. He later realized this is best defined by Greek word “meraki.” While not having a direct translation in English, “meraki” modern Greeks use describe putting piece of yourself, such as your soul or creativity, into This exactly what has done throughout pursuits academia, industry, beyond.

We consider generalized shortest path problems with cost and weight functions for the arcs of a graph. According to their weight arcs may generate or consume ow. Weights may be additive or multiplicative on a path. More precisely, if x units enter an arc a = (u; v) then x + w(a) resp. x w(a) leave it. The cost is charged per unit and summed over the edges of a path. If the weights multiply, the...

We describe a common generalization of the weighted matching problem and the weighted matroid intersection problem. In this context we establish common generalizations of the main results on those two problems|polynomial-time solvability, min-max theorems, and totally dual integral polyhedral descriptions. New applications of these results include a strongly polynomial separation algorithm for ...