A decomposition-based pricing method for solving a large-scale MILP model for an integrated fishery.
A Decomposition-Dualization Approach for Solving Constraint Convex Minimization Problems with Applications to Discretized Obstacle Problems.
A density result in vector optimization.
A derivation of Lovász’ theta via augmented Lagrange duality
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász number.
A Derivation of Lovász' Theta via Augmented Lagrange Duality
A recently introduced dualization technique for binary linear programs with equality constraints, essentially due to Poljak et al. [13], and further developed in Lemaréchal and Oustry [9], leads to simple alternative derivations of well-known, important relaxations to two well-known problems of discrete optimization: the maximum stable set problem and the maximum vertex cover problem. The resulting relaxation is easily transformed to the well-known Lovász θ number.
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 approximation in the ruin problem for a controlled Markov chain
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 contact model for crowd motion
The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here the...
A discrete contact model for crowd motion
The aim of this paper is to develop a crowd motion model designed to handle highly packed situations. The model we propose rests on two principles: we first define a spontaneous velocity which corresponds to the velocity each individual would like to have in the absence of other people. The actual velocity is then computed as the projection of the spontaneous velocity onto the set of admissible velocities (i.e. velocities which do not violate the non-overlapping constraint). We describe here...
A Discrete Projection Quasi Newton Method for Linearly Constrained Problems
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 approximation technique for the time-cost trade-off in PERT networks
We develop a discrete-time approximation technique dealing with the time-cost trade-off problem in PERT networks. It is assumed that the activity durations are independent random variables with generalized Erlang distributions, in which the mean duration of each activity is a non-increasing function of the amount of resource allocated to it. It is also assumed that the amount of resource allocated to each activity is controllable. Then, we construct an optimal control problem with three conflicting...
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...