Is presented the structure of a formal framework for personalization features for mobile business services, which can be used to drive the business modeling of M-business services from a service provider point of view. It also allows to compute the revenue as linked to personalization levels and...

A new smoothing approach based on entropic perturbation is proposed for solving mathematical programs with equilibrium constraints. Some of the desirable properties of the smoothing function are shown. The viability of the proposed approach is supported by a computationalstudy on a set of...

In this article we focus on product return handling and warehousing issues. In some businesses return rates can be well over 20% and returns can be especially costly when not handled properly. In spite of this, many managers have handled returns extemporarily. The fact that quantitative methods...

The Port of Rotterdam is a key container transshipment hub for Europe. Inland container shipping is important to connect the hinterland (40% market share). Barges visit several terminals per round-trip through the Port, thus requiring a proper planning support – to avoid planning problems such...

We analyze a newsboy problem with resalable returns. A single order is placed before the selling season starts. Purchased products may be returned by the customer for a full refund within a certain time interval. Returned products are resalable, provided they arrive back before the end of the...

Ports provide jetty facilities for ships to load and unload their cargo. Jetty capacity is costly and therefore limited, causing delays for arriving ships. However, ship delays are also costly, so terminal operators attempt to min imize their number and duration. Here, simulation has proved to...

For classification problems with ordinal attributes very often the class attribute should increase with each or some of the explaining attributes. These are called classification problems with monotonicity constraints. Classical decision tree algorithms such as CART or C4.5 generally do not...

We present new lower bounds for the Capacitated Lot Sizing Problem with Set Up Times. We improve the lower bound obtained by the textbook Dantzig-Wolfe decomposition where the capacity constraints are the linking constraints. In our approach, Dantzig-Wolfe decomposition is applied to the network...