Tournaments as feedback arc sets.
Toward Optimal Feature Selection Using Ranking Methods and Classification Algorithms
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,...
Towards an extension of the 2-tuple linguistic model to deal with unbalanced linguistic term sets
In the domain of Computing with words (CW), fuzzy linguistic approaches are known to be relevant in many decision-making problems. Indeed, they allow us to model the human reasoning in replacing words, assessments, preferences, choices, wishes... by ad hoc variables, such as fuzzy sets or more sophisticated variables. This paper focuses on a particular model: Herrera and Martínez' 2-tuple linguistic model and their approach to deal with unbalanced linguistic term sets. It is interesting since the...
Towards optimal formwork pairing on construction sites
Minimizing shutterings assembling time on construction sites can yield significant savings in labor costs and crane moves. It requires solving a pairing problem that optimizes the ability for the crane to move chains of shutterings as a whole when they can be later reused together to frame another wall of the site. In this paper, we show that this problem is NP-hard in the strong sense as well as both its multiflow and ordering aspects. We also introduce a linear relaxation that computes reasonably...
Tractable algorithms for chance-constrained combinatorial problems
This paper aims at proposing tractable algorithms to find effectively good solutions to large size chance-constrained combinatorial problems. A new robust model is introduced to deal with uncertainty in mixed-integer linear problems. It is shown to be strongly related to chance-constrained programming when considering pure 0–1 problems. Furthermore, its tractability is highlighted. Then, an optimization algorithm is designed to provide possibly good solutions to chance-constrained combinatorial...
Traffic plans.
In recent research in the optimization of transportation networks, the problem was formalized as finding the optimal paths to transport a measure y+ onto a measure y- with the same mass. This approach is realistic for simple good distribution networks (water, electric power,. ..) but it is no more realistic when we want to specify who goes where, like in the mailing problem or the optimal urban traffic network problem. In this paper, we present a new framework generalizing the former approathes...
Training multi-layered neural network with a trust-region based algorithm
TRANSCAT DSS architecture and modelling services
Transformations of Dual Problem and Decreasing Dimensions in Linear Programming
Transient analysis of a fluid queue driven by a birth and death process suggested by a chain sequence.
Transient analysis of a queue where potential customers are discouraged by queue length.
Transient analysis of a queue with queue-length dependent map and its application to SS7 network.
Transient phenomena and self-optimizing control of Markov chains
Transport Modeling: an Artificial Immune System Approach
Transportation flow problems with Radon measure variables
For a multidimensional control problem involving controls , we construct a dual problem in which the variables ν to be paired with u are taken from the measure space rca (Ω,) instead of . For this purpose, we add to a Baire class restriction for the representatives of the controls u. As main results, we prove a strong duality theorem and saddle-point conditions.
Transportation networks with random arc capacities
Transportation Technique for a Particular Convex Programming Problem
Transports industriels routiers, un problème d'affectation avec réemploi sous contraintes
Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem
In this paper we deal with the preemptive asymmetric stacker crane problem in a heuristic way. We first present some theoretical results which allow us to turn this problem into a specific tree design problem. We next derive from this new representation an integer linear programming model together with simple and efficient greedy and local search heuristics. We conclude by presenting experimental results which aim at both testing the efficiency of our heuristic and evaluating the impact of the...