Buscar
Mostrando ítems 1-10 de 667
Lagrangian heuristic for a class of the generalized assignment problems
(Pergamon-Elsevier B.V. Ltd, 2010-08-01)
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy ...
Lagrangian heuristic for a class of the generalized assignment problems
(Pergamon-Elsevier B.V. Ltd, 2010-08-01)
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account capacity limits for task and agents. A modified Lagrangian bound studied earlier by the authors is presented and a greedy ...
A Lagrangian bound for many-to-many assignment problems
(Springer, 2010-04-01)
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem ...
A Lagrangian bound for many-to-many assignment problems
(Springer, 2010-04-01)
A simple procedure to tighten the Lagrangian bounds is proposed. The approach is interpreted in two ways. First, it can be seen as a reformulation of the original problem aimed to split the resulting Lagrangian problem ...
A mortar method combined with an augmented Lagrangian approach for treatment of mechanical contact problems
(Springer, 2014)
This work presents a mixed penalty-duality formulation from an augmented Lagrangian approach for treating the contact inequality constraints. The augmented Lagrangian approach allows to regularize the non differentiable ...
A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem
(Elsevier B.V., 2009-06-01)
Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. ...
A Lagrangian relaxation approach to a coupled lot-sizing and cutting stock problem
(Elsevier B.V., 2009-06-01)
Industrial production processes involving both lot-sizing and cutting stock problems are common in many industrial settings. However, they are usually treated in a separate way, which could lead to costly production plans. ...
A Lagrangian bound for many-to-many assignment problems
(Springer, 2014)
About ambiguities apperarting on the study of classical and quantum harmonic oscillator
(Revista Mexicana de Física, 2009)
Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem
(ELSEVIER SCIENCE INC, 2008)
A new approach for solving the optimal power flow (OPF) problem is established by combining the reduced gradient method and the augmented Lagrangian method with barriers and exploring specific characteristics of the relations ...