Displaying similar documents to “Numerical solutions of the mass transfer problem”

Tractable algorithms for chance-constrained combinatorial problems

Olivier Klopfenstein (2009)

RAIRO - Operations Research

Similarity:

This paper aims at proposing tractable algorithms to find effectively good solutions to large size chance-constrained combinatorial problems. A new robust model is introduced to deal with uncertainty in mixed-integer linear problems. It is shown to be strongly related to chance-constrained programming when considering pure 0–1 problems. Furthermore, its tractability is highlighted. Then, an optimization algorithm is designed to provide possibly good solutions to chance-constrained...

Uniqueness and approximate computation of optimal incomplete transportation plans

P. C. Álvarez-Esteban, E. del Barrio, J. A. Cuesta-Albertos, C. Matrán (2011)

Annales de l'I.H.P. Probabilités et statistiques

Similarity:

For ∈(0, 1) an -trimming, ∗, of a probability is a new probability obtained by re-weighting the probability of any Borel set, , according to a positive weight function, ≤1/(1−), in the way ∗()= ()(d). If ,  are probability measures on euclidean space, we consider the problem of obtaining the best 2-Wasserstein approximation between: (a) a fixed probability and trimmed versions of the other; (b) trimmed versions of both probabilities. These best trimmed...

A threshold accepting approach to the Open Vehicle Routing problem

Christos D. Tarantilis, George Ioannou, Chris T. Kiranoudis, Gregory P. Prastacos (2010)

RAIRO - Operations Research

Similarity:

In this paper we consider the operational planning problem of physical distribution a fleet of hired vehicles, for which the travelling cost is solely a function of the sequence of locations visited within all open delivery routes, while vehicle fixed cost is inexistent. The problem is a special class of vehicle routing and is encountered in the literature as the Open Vehicle Routing Problem (OVRP), since vehicles are not required to return to the depot. The goal is to distribute...