The transient M/G/1/0 queue: Some bounds and approximations for light traffic with application to reliability.
The traveling salesman problem and harmonic analysis.
In this paper we propose to discuss some relationships between the classical Traveling Salesman Problem (TSP), Litlewood-Paley theory, and harmonic measure. This circle of ideas is also closely related to the theory of Cauchy integrals on Lipschitz graphs, and this aspect is discussed more fully in the paper of David and Semmes [2] in this proceedings. The main differences between the subjects in [2] and this paper are that the results here are valid for one dimensional sets, whereas [2] treats...
The traveling salesman problem for cubic graphs.
The tropical Grassmannian.
The Truncated Hyper-Poisson Queues: With Balking, Reneging and General Bulk Service Rule
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
The use of graphics card and nVidia CUDA architecture in the optimization of the heat radiation intensity
The paper focuses on the acceleration of the computer optimization of heat radiation intensity on the mould surface. The mould is warmed up by infrared heaters positioned above the mould surface, and in this way artificial leathers in the automotive industry are produced (e.g. for car dashboards). The presented heating model allows us to specify the position of infrared heaters over the mould to obtain approximately even heat radiation intensity on the whole mould surface. In this way we can obtain...
The Usefulness and Beauty of Combinational Optimization
The variance location problem on a network with continuously distributed demand
The Variance Location Problem on a Network with Continuously distributed demand
Most location problems on networks consider discrete nodal demand. However, for many problems, demands are better represented by continuous functions along the edges, in addition to nodal demands. Several papers consider the optimal location problem of one or more facilities when demands are continuously distributed along the network, and the objective function dealt with is the median one. Nevertheless, in location of public services it is desirable to use an equity criterion. One of the latter...
The vehicle routing problem
The weighted Fermat triangle problem.
The weighted minimax location problem with set-up costs and extensions
Theorems of the alternative for cones and Lyapunov regularity of matrices
Standard facts about separating linear functionals will be used to determine how two cones and and their duals and may overlap. When is linear and and are cones, these results will be applied to and , giving a unified treatment of several theorems of the alternate which explain when contains an interior point of . The case when is the space of Hermitian matrices, is the positive semidefinite matrices, and yields new and known results about the existence of block diagonal...
Theoretical analysis of steady state genetic algorithms
Evolutionary Algorithms, also known as Genetic Algorithms in a former terminology, are probabilistic algorithms for optimization, which mimic operators from natural selection and genetics. The paper analyses the convergence of the heuristic associated to a special type of Genetic Algorithm, namely the Steady State Genetic Algorithm (SSGA), considered as a discrete-time dynamical system non-generational model. Inspired by the Markov chain results in finite Evolutionary Algorithms, conditions are...
Théorie de la pénalisation exacte
Théorie des processus de production
Thin and heavy tails in stochastic programming
Optimization problems depending on a probability measure correspond to many applications. These problems can be static (single-stage), dynamic with finite (multi-stage) or infinite horizon, single- or multi-objective. It is necessary to have complete knowledge of the “underlying” probability measure if we are to solve the above-mentioned problems with precision. However this assumption is very rarely fulfilled (in applications) and consequently, problems have to be solved mostly on the basis of...
Three different operations research models for the same policy.
Three Digit Accurate Multiple Normal Probabilities.