We study the General Routing Problem defined on a mixed graph and with stochastic demands. The problem under investigation is aimed at finding the minimum cost set of routes to satisfy a set of clients whose demand is not deterministically known. Since each vehicle has a limited capacity, the...

The Mixed Capacitated General Routing Problem (MCGRP) is defined over a mixed graph, for which some vertices must be visited and some links must be traversed at least once. The problem consists of determining a set of least-cost vehicle routes that satisfy this requirement and respect the...

This paper is concerned with the formulation and the solution of a probabilistic model for determining the optimal location of facilities in congested emergency systems. The inherent uncertainty which characterizes the decision process is handled by a new stochastic programming paradigm which...

The cutting stock problem (CSP) is one of the most fascinating problems in operations research. The problem aims at determining the optimal plan to cut a number of parts of various length from an inventory of standard-size material so to satisfy the customers demands. The deterministic CSP...