All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 7 Next

Displaying 121 – 140 of 144

Showing per page

Towards an extension of the 2-tuple linguistic model to deal with unbalanced linguistic term sets

Mohammed-Amine Abchir, Isis Truck (2013)

Kybernetika

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...

Tractable algorithms for chance-constrained combinatorial problems

Olivier Klopfenstein (2009)

RAIRO - Operations Research

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...

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)

RAIRO - Operations Research

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...

Tree based models and algorithms for the preemptive asymmetric Stacker Crane problem

Hervé Kerivin, Mathieu Lacroix, Alain Quilliot, Hélène Toussaint (2011)

RAIRO - Operations Research

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...

Trivial Cases for the Kantorovitch Problem

Serge Dubuc, Issa Kagabo, Patrice Marcotte (2010)

RAIRO - Operations Research

Let X and Y be two compact spaces endowed with respective measures μ and ν satisfying the condition µ(X) = v(Y). Let c be a continuous function on the product space X x Y. The mass transfer problem consists in determining a measure ξ on X x Y whose marginals coincide with μ and ν, and such that the total cost ∫ ∫ c(x,y)dξ(x,y) be minimized. We first show that if the cost function c is decomposable, i.e., can be represented as the sum of two continuous functions defined on X and Y, respectively,...

Two characterizations of Pareto minima in convex multicriteria optimization

Sanjo Zlobec (1984)

Aplikace matematiky

Two conditions are given each of which is both necessary and sufficient for a point to be a global Pareto minimum. The first one is obtained by studying programs where each criterion appears as a single objective function, while the second one is given in terms of a "restricted Lagrangian". The conditions are compared with the familiar characterizations of properly efficient and weakly efficient points of Karlin and Geoffrion.

Currently displaying 121 – 140 of 144