Algoritmi di ottimizzazione globale
Algoritmo del elipsoide interior para programación lineal.
En este artículo se desarrolla un algoritmo de puntos interiores para programación lineal a partir de consideraciones geométricas. En cada iteración del método se dispone de un punto interior al politopo. Con centro en dicho punto se obtiene un elipsoide interior a dicho politopo. La optimización de la función objetivo lineal sobre el elipsoide se obtiene mediante la solución de un problema de mínimos cuadrados. El punto resultante se adopta para la siguiente iteración. Se proponen dos métodos diferentes...
Algoritmos heurísticos deterministas y aleatorios en secuenciación de proyectos con recursos limitados.
En este trabajo se estudia la eficiencia relativa de un conjunto de algoritmos heurísticos, deterministas y aleatorizados, para el problema de la secuenciación de proyectos con limitación de recursos. Se presentan los resultados de un extenso estudio computacional y se aplican tests no paramétricos para contrastar estadísticamente las conclusiones obtenidas.
Algunos resultados sobre sistemas de desigualdades lineales.
En este artículo aplicamos la condición de Mazur-Orlicz para extender a espacios normados algunos resultados de consistencia de desigualdades lineales (s.d.l.) en Rn. Asimismo, obtenemos condiciones para la consistencia de s.d.l. en un espacio localmente convexo, cuando las soluciones pertenecen a ciertos subconjuntos del dual topológico.
Alguns teoremas sobre a equivalência do problema do caixeiro viajante múltiplo ao problema do caixeiro viajante
ALIO/EURO V conference on combinatorial optimization
ALIO/EURO V Conference on Combinatorial Optimization (ENST, Paris, 26–28 October 2005)
Allocating servers to facilities, when demand is elastic to travel and waiting times
Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers’ travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...
Allocating servers to facilities, when demand is elastic to travel and waiting times
Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers' travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...
Alternating projected Barzilai-Borwein methods for nonnegative matrix factorization.
Amélioration de la stabilité numérique d'algorithmes de résolution de programmes linéaires à matrices de contraintes clairsemées
Amélioration de l'utilisation d'une flotte aérienne partagée entre deux bases principales (Génération de convoyages)
Amélioration d'un ordonnancement dans le cas d'une fabrication de type linéaire
An worst case bounded special knapsack with two constraints
An accurate active set Newton algorithm for large scale bound constrained optimization
A new algorithm for solving large scale bound constrained minimization problems is proposed. The algorithm is based on an accurate identification technique of the active set proposed by Facchinei, Fischer and Kanzow in 1998. A further division of the active set yields the global convergence of the new algorithm. In particular, the convergence rate is superlinear without requiring the strict complementarity assumption. Numerical tests demonstrate the efficiency and performance of the present strategy...
An active set strategy based on the multiplier function or the gradient
We employ the active set strategy which was proposed by Facchinei for solving large scale bound constrained optimization problems. As the special structure of the bound constrained problem, a simple rule is used for updating the multipliers. Numerical results show that the active set identification strategy is practical and efficient.
An adaptive long step interior point algorithm for linear optimization
It is well known that a large neighborhood interior point algorithm for linear optimization performs much better in implementation than its small neighborhood counterparts. One of the key elements of interior point algorithms is how to update the barrier parameter. The main goal of this paper is to introduce an “adaptive” long step interior-point algorithm in a large neighborhood of central path using the classical logarithmic barrier function having iteration complexity analogous to the classical...
An adaptive parallel projection method for solving convex feasibility problems.
An Algorithm for a Linear Diophantine Equation and a Problem of Frobenius.
An Algorithm for Calculating One Subgradient of a Convex Function of Two Variables.