Characterizing Optimality in Nonconvex Optimizationi
Charge stationnaire d'une file d'attente à rejet. Application au cas indépendant
Charge stationnaire d'une file d'attente à rejet. Cas de plusieurs serveurs
Charges stationnaires d'une file d'attente avec blocages
Chemins extrémaux d'un graphe doublement valué
Choix du type de gestion de stock
Choix multicritères dans le risque et variables multidimensionnelles : proposition de méthode et application aux réseaux de transport d'énergie
Choix multicritères dans le risque et variables multidimensionnelles: proposition de méthode et application aux réseaux de transport d'énergie
This paper presents an application of Multiple Attribute Utility Theory on strategic choices concerning energy transportation. The environmental assessment of a network reinforcement strategy is emphasized. Our assessment brings about to consider multidimensional variables in MCDM. However, Multi-Attributed Utility Theory (MAUT) cannot, as a practical matter, manage such variables. We therefore work out a methodology to transform multidimensional variables into unidimensional ones. We apply...
CLAS - A Formal Aid to Data Elements Identification
Clasificación en programación multiobjetivo.
En el presente trabajo, después de justificar lo importante que resulta para el decisor, en muchos casos, el poder obtener clasificaciones en el conjunto de objetivos de un problema de Porgramación Multiobjetivo, se hace un estudio algorítmico que permite agruparlos en función de ciertos niveles de conformidad.
Classical hierarchies form a modern standpoint. Part III. BP-sets
Classification of Objects Based on Case-Based Reasoning
Clique partitioning of interval graphs with submodular costs on the cliques
Given a graph G = (V,E) and a “cost function” (provided by an oracle), the problem [PCliqW] consists in finding a partition into cliques of V(G) of minimum cost. Here, the cost of a partition is the sum of the costs of the cliques in the partition. We provide a polynomial time dynamic program for the case where G is an interval graph and f belongs to a subclass of submodular set functions, which we call “value-polymatroidal”. This provides a common solution for various generalizations of the...
Clique-connecting forest and stable set polytopes
Let G = (V,E) be a simple undirected graph. A forest F ⊆ E of G is said to be clique-connecting if each tree of F spans a clique of G. This paper adresses the clique-connecting forest polytope. First we give a formulation and a polynomial time separation algorithm. Then we show that the nontrivial nondegenerate facets of the stable set polytope are facets of the clique-connecting polytope. Finally we introduce a family of rank inequalities which are facets, and which generalize the clique inequalities. ...
Closedness of the solution mapping to parametric vector equilibrium problems.
Closedness type regularity conditions for surjectivity results involving the sum of two maximal monotone operators
In this note we provide regularity conditions of closedness type which guarantee some surjectivity results concerning the sum of two maximal monotone operators by using representative functions. The first regularity condition we give guarantees the surjectivity of the monotone operator S(· + p) + T(·), where p ɛ X and S and T are maximal monotone operators on the reflexive Banach space X. Then, this is used to obtain sufficient conditions for the surjectivity of S + T and for the situation when...
Codimension one minimal projections in Banach spaces and a mathematical programming problem [Book]
Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem
The features of an evolutionary algorithm that most determine its performance are the coding by which its chromosomes represent candidate solutions to its target problem and the operators that act on that coding. Also, when a problem involves constraints, a coding that represents only valid solutions and operators that preserve that validity represent a smaller search space and result in a more effective search. Two genetic algorithms for the leaf-constrained minimum spanning tree problem illustrate...
Coercivity properties and well-posedness in vector optimization
This paper studies the issue of well-posedness for vector optimization. It is shown that coercivity implies well-posedness without any convexity assumptions on problem data. For convex vector optimization problems, solution sets of such problems are non-convex in general, but they are highly structured. By exploring such structures carefully via convex analysis, we are able to obtain a number of positive results, including a criterion for well-posedness in terms of that of associated scalar problems....
Coercivity properties and well-posedness in vector optimization*
This paper studies the issue of well-posedness for vector optimization. It is shown that coercivity implies well-posedness without any convexity assumptions on problem data. For convex vector optimization problems, solution sets of such problems are non-convex in general, but they are highly structured. By exploring such structures carefully via convex analysis, we are able to obtain a number of positive results, including a criterion for well-posedness in terms of that of associated scalar...