Given a network N(V, A, u, c) and a feasible flow x0, an inverse minimum cost flow problem is to modify the cost vector as little as possible to make x0 form a minimum cost flow of the network. The modification can be measured by different norms. In this paper, we consider the inverse minimum...

The global markets of today offer more selling opportunities to the deteriorating items' manufacturers, but also pose new challenges in production and inventory planning. From a production management standpoint, opportunities to exploit the difference in the timing of the selling season between...