Three different operations research models for the same policy.
Three Digit Accurate Multiple Normal Probabilities.
Three Dimensional Fixed Charge Bi-Criterion Indefinite Quadratic Transportation Problem
Three easy special cases of the euclidean travelling salesman problem
Three tabu search methods for the MI-FAP applied to 802.11 networks
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...
Three tabu search methods for the MI-FAP applied to 802.11 networks
Wireless LAN using IEEE 802.11 networks are now widely deployed at home by residential users or in hot spots by telecommunication operators. A hot spot is a place where a set of access points (APs) are located nearby each other and can serve many users. Since perturbations can degrade the quality of the signal, a careful channel assignment to each AP has to be done. Channel assignment of APs at hot spots, and more generally setup configuration and management, is still often done manually. In this...
Tikhonov regularization and constrained quadratic programming for magnetic coil design problems
Tilt stability in nonlinear programming under Mangasarian-Fromovitz constraint qualification
The paper concerns the study of tilt stability of local minimizers in standard problems of nonlinear programming. This notion plays an important role in both theoretical and numerical aspects of optimization and has drawn a lot of attention in optimization theory and its applications, especially in recent years. Under the classical Mangasarian-Fromovitz Constraint Qualification, we establish relationships between tilt stability and some other stability notions in constrained optimization. Involving...
Time Minimizing Transportation Problem with Fractional Bottleneck Objective Function
Time Petri nets state space reduction using dynamic programming
Time-discretization for controlled Markov processes. I. General approximation results
Time-discretization for controlled Markov processes. II. A jump and diffusion application
Time-varying Markov decision processes with state-action-dependent discount factors and unbounded costs
In this paper we are concerned with a class of time-varying discounted Markov decision models with unbounded costs and state-action dependent discount factors. Specifically we study controlled systems whose state process evolves according to the equation , with state-action dependent discount factors of the form , where and are the control and the random disturbance at time , respectively. Assuming that the sequences of functions , and converge, in certain sense, to , and , our...
Tolerance problems for generalized eigenvectors of interval fuzzy matrices
Fuzzy algebra is a special type of algebraic structure in which classical addition and multiplication are replaced by maximum and minimum (denoted and , respectively). The eigenproblem is the search for a vector (an eigenvector) and a constant (an eigenvalue) such that , where is a given matrix. This paper investigates a generalization of the eigenproblem in fuzzy algebra. We solve the equation with given matrices and unknown constant and vector . Generalized eigenvectors have interesting...
Topological degree for maximal monotone operators and application to parametric optimization problems.
Total Time Minimizing Transportation Problem
Totally greedy coin sets and greedy obstructions.
Tour d'horizon : programmation non linéaire
Tournaments as feedback arc sets.
Towards a theory of practice in metaheuristics design: A machine learning perspective
A number of methodological papers published during the last years testify that a need for a thorough revision of the research methodology is felt by the operations research community – see, for example, [Barr et al., J. Heuristics1 (1995) 9–32; Eiben and Jelasity, Proceedings of the 2002 Congress on Evolutionary Computation (CEC'2002) 582–587; Hooker, J. Heuristics1 (1995) 33–42; Rardin and Uzsoy, J. Heuristics7 (2001) 261–304]. In particular, the performance evaluation of nondeterministic methods,...