We show that, in any undirected graph, splitting off can be performed while preserving all cuts of value at most 4/3 times the minimum value, and this is best possible. This generalizes a classical splitting-off result of Lovasz.

The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cost for opening a facility and also for connecting a customer to a facility, the goal being to minimize the total cost....

In this note we give an alternate proof that a scheduling algorithm of Lawler [3,4] finds the optimal solution for 1 / prec / SIGMAj wj Cj when the precedence constraints are series-parallel. We do this by using a linear programming formulation of 1 / prec / SIGMAj wj Cj introduced by Queyranne...

This paper investigates the optimal taxation path of a non-renewable resource in the presence of an imperfect substitute renewable resource. We present an optimal growth model and characterize the social optimum and the decentralized equilibrium. We show that the economy gradually reduces the...

We consider a continuous-time variant of the classical Economic Lot-Sizing (ELS) problem. In this model, the setup cost is a continuous function with lower bound $K_min 0$, the demand and holding costs are integrable functions of time and the replenishment decisions are not restricted to be...

One of the pervasive problems with means-tested public long term care (LTC) programs is their inability to prevent individuals who could afford private long term services from taking advantage of public care. They often manage to elude the means-test net through “strategic impoverishment”....

We propose an estimation method that circumvents the path dependence problem existing in Change-Point (CP) and Markov Switching (MS) ARMA models. Our model embeds a sticky infinite hidden Markov-switching structure (sticky IHMM), which makes possible a self-determination of the number of regimes...