Decision Models for Industrial Plant Location Planning
Decisión multicriterio a través de problemas de optimización cuadrático-fraccionales.
Decision tree design by simulated annealing
Decomposable non-negative matrices in a dynamic programming problem
Décomposition en matrices graphiques de matrices en : application à la résolution de programmes linéaires entiers
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
Décomposition temporelle et caractérisation de solutions admissibles pour le problème d'ordonnancement à une machine
We propose a temporal decomposition approach for the one-machine scheduling problem with ready times and due dates. A set of feasible schedules is characterized by means of constraint-based analysis rules. They permit the determination of the feasible locations of each task in a sequence, represented by rank intervals. A decomposition procedure based on comparisons of rank intervals is developed in order to group tasks to be sequenced in the neighbourhood of each other in a feasible solution. Computational...
Decompositions of compact convex sets.
Decrease of C1,1 property in vector optimization
In the paper we generalize sufficient and necessary optimality conditions obtained by Ginchev, Guerraggio, Rocca, and by authors with the help of the notion of ℓ-stability for vector functions.
Del poliedro del agente viajero gráfico al de rutas de vehículos con demanda compartida.
En este trabajo abordamos el estudio del poliedro asociado al Problema de Rutas de Vehículos con Demanda Compartida, problema de distribución que surge cuando hay que repartir mercancías a un conjunto de clientes utilizando una flota fija de vehículos de capacidad limitada. El objetivo es diseñar las rutas de forma que se minimice la distancia total recorrida. Se diferencia de otros problemas más conocidos de rutas con capacidades en que se permite abastecer la demanda de cada cliente utilizando...
Dentable functions and radially uniform quasi-convexity.
Déplacement de matériel continu unidimensionnel à moindre coût
Der diskontierte Einarmige Bandit.
Der Satz von Fenchel in der konvexen Optimierung.
Derivative Free Analogues of the Levenberg-Marquardt and Gauss Algorithms for Nonlinear Least Squares Approximation.
Derivative-free nonlinear optimization filter simplex
The filter method is a technique for solving nonlinear programming problems. The filter algorithm has two phases in each iteration. The first one reduces a measure of infeasibility, while in the second the objective function value is reduced. In real optimization problems, usually the objective function is not differentiable or its derivatives are unknown. In these cases it becomes essential to use optimization methods where the calculation of the derivatives or the verification of their existence...
Derivatives of orbital function and an extension of Berezin-Gel’fand’s theorem
A generalization of a result of Berezin and Gel’fand in the context of Eaton triples is given. The generalization and its proof are Lie-theoretic free and requires some basic knowledge of nonsmooth analysis. The result is then applied to determine the distance between a point and a G-orbit or its convex hull.We also discuss the derivatives of some orbital functions.
Des algorithmes linéaires pour les problèmes de partition, de recouvrement et de couplage dans les hypergraphes d'intervalles
Des exemples de programmation non linéaire en théorie des nombres
Des exemples de programmation non linéaire en théorie des nombres