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...
Three-linking in Eulerian digraphs
Three-Stage Entry Game: the Strategic Effects of Advertising
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
Timed Petri-net based formulation and an algorithm for the optimal scheduling of batch plants
The effective scheduling of operations in batch plants has a great potential for high economic returns, in which the formulation and an optimal solution algorithm are the main issues of study. Petri nets have proven to be a promising technique for solving many difficult problems associated with the modelling, formal analysis, design and coordination control of discrete-event systems. One of the major advantages of using a Petri-net model is that the same model can be used for the analysis of behavioural...
Time-delay polynomial networks and rates of approximation.
Time–dependent Simple Temporal Networks: Properties and Algorithms
Simple Temporal Networks (STN) allow conjunctions of minimum and maximum distance constraints between pairs of temporal positions to be represented. This paper introduces an extension of STN called Time–dependent STN (TSTN), which covers temporal constraints for which the minimum and maximum distances required between two temporal positions x and y are not necessarily constant but may depend on the assignments of x and y. Such constraints are useful to model problems in which the duration of an...
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...
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