A decision support system for regional hazardous waste management alternatives.
A decomposition heuristic for the maximal covering location problem.
A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery.
A Descent-Ascent Technique for Solving the Multi-Source Weber Problem
A design based on object programming of a module of integrated ERP systems for small and medium enterprises.
A diffusion model for two parallel queues with processor sharing: Transient behavior and asymptotics.
A dimension-reduction algorithm for multi-stage decision problems with returns in a partially ordered set
In this paper a two-stage algorithm for finding non- dominated subsets of partially ordered sets is established. A connection is then made with dimension reduction in time-dependent dynamic programming via the notion of a bounding label, a function that bounds the state-transition cost functions. In this context, the computational burden is partitioned between a time-independent dynamic programming step carried out on the bounding label and a direct evaluation carried out on a subset of “real” valued...
A Dimension-Reduction Algorithm for Multi-Stage Decision Problems with Returns in a Partially Ordered Set
In this paper a two-stage algorithm for finding non- dominated subsets of partially ordered sets is established. A connection is then made with dimension reduction in time-dependent dynamic programming via the notion of a bounding label, a function that bounds the state-transition cost functions. In this context, the computational burden is partitioned between a time-independent dynamic programming step carried out on the bounding label and a direct evaluation carried out on a subset of “real"...
A discrete approximation of the Weber problem with Euclidean distance
A discrete single server queue with Markovian arrivals and phase type group services.
A discrete theory of search. I
A discrete theory of search. II
A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service
This paper concerns a discrete time Geo[X]/G/1 retrial queue with general retrial time in which all the arriving customers require first essential service with probability while only some of them demand one of other optional services: type − r (r = 1, 2, 3,...M) service with probability . The system state distribution, the orbit size and the system size distributions are obtained in terms of generating functions. The stochastic decomposition law holds for the proposed model. Performance measures...
A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service
This paper concerns a discrete time Geo[X]/G/1 retrial queue with general retrial time in which all the arriving customers require first essential service with probability while only some of them demand one of other optional services: type − r (r = 1, 2, 3,...M) service with probability . The system state distribution, the orbit size and the system size distributions are obtained in terms of generating functions. The stochastic decomposition law holds for the proposed model. Performance measures...
A discrete-time system with service control and repairs
A dual algorithm for the minimal cost flow problem
A dual feasible forest algorithm for the linear assignment problem
A dynamic model of advertising competition: an empirical analysis of feedback strategies
A dynamic programming algorithm for the buffer allocation problem in homogeneous asymptotically reliable serial production lines.
A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures
In this paper, we demonstrate the computational consequences of making a simple assumption on production cost structures in capacitated lot-size problems. Our results indicate that our cost assumption of increased productivity over time has dramatic effects on the problem sizes which are solvable. Our experiments indicate that problems with more than 1000 products in more than 1000 time periods may be solved within reasonable time. The Lagrangian decomposition algorithm we use does of course not...