Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks

Stochastic lot sizing manufacturing under the ETS system for maximisation of shareholder wealth

“…We characterize them by their probabilistic merits-expected values and standard deviations, without any assumption on their distributions. This improves the generality and extendibility of the proposed model, for the factitious distribution assumptions are quite restrictive, often leading to impractical optimisation results (Morabito, Souza & Vazquez, 2014).…”

Multicommodity Network Flows With Nonconvex Arc Costs

“…Finally, we observe that MCF is a special case of general MINLP (Mixed-Integer Nonlinear Programming) for which recent developments are promising (see [46] and [22] for a survey). Many potential applications of these new algorithms have a potential multicommodity structure like water networks [21], gas networks [4,69], energy networks [31,75] or transportation networks [38], and naturally communications networks remain a very rich field for challenging network design problems (see for example [23] and [73]).…”

Allocation of flows in closed bipartite queueing networks

“…Flow optimization in open networks has been studied using a nonlinear programming framework [15] [13], a Markov decision process framework [14], and a Brownian heavy-traffic approximation [16]. A two-stage approach to optimizing multicommodity flows in generalized networks using network approximations was developed in [17]. Whittle describes a method of maximizing the saturation throughput of an open network by selecting routing probabilities [15].…”