In this paper, we study the location routing problem with replenishment facilities (LRPRF), an extension of the location routing problem (LRP) where the vehicles can replenish at some replenishment facilities. Vehicles leave the depot with load on-board, serve customers until out of load, and then either return to a replenishment facility to reload or return to the depot, completing their route...

We determine the ultimate classical information capacity of a linear time-invariant bosonic channel with additive phase-insensitive Gaussian noise. This channel can model fiber-optic communication at power levels below the threshold for significant nonlinear effects. We provide a general continuous-time result that gives the ultimate capacity for such a channel operating in the quasimonochromat...

We calculate the information capacity of a neuron emitting as a Poisson process in response to a static stimulus, and the stimulus distribution required to reach the capacity, in the case of a constraint on the average frequency. These optimal stimulus distributions (i.e. the ones reaching the information capacity) are then reexpressed in terms of`tuning curves' for neurons with a continuous re...

The sum capacity of a multiuser synchronous CDMA system is completely characterized in the general case of asymmetric user power constraints this solves the open problem posed in [7] which had solved the equal power constraint case. We identify the signature sequences with real components that achieve sum capacity and indicate a simple recursive algorithm to construct them.

The bin packing problem (BP) consists in finding the minimum number of bins necessary to pack a set of items so that the total size of the items in each bin does not exceed the bin capacity C. The bin capacity is common for all the bins. This problem can be solved in Constraint Programming (CP) by introducing one placement variable xi for each item and one load variable lj for each bin. The Pac...