Add to ORKGRecently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomposition and bound improving sequences. In this work we will obtain a Lagrangean approach combining the two ideas mentioned above. We provide theoretical results about the sharpness of the bounds obtained by the combined approach for the general case and an application to the generalized assignment problem. Computational experience is reported.N/
The assignment problem of matching the elements of two sets at some cost or to some benefit is well ...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
AbstractIn 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like pro...
Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomp...
Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Variable splittin...
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a doubl...
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a doubl...
In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is bas...
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account ca...
AbstractA Lagrangian based heuristic is proposed for many-to-many assignment problems taking into ac...
AbstractWe discuss the relationship between Gilmore–Lawler lower bounds with decomposition for the q...
Lagrangian relaxation is a widely used decomposition approach to solve difficult optimization proble...
Abstract We examine the basis structure of the linear relaxation of the generalized assignment probl...
In this paper we present a generalization and a computational improvement of the Bound Improvement S...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
The assignment problem of matching the elements of two sets at some cost or to some benefit is well ...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
AbstractIn 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like pro...
Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Lagrangean decomp...
Recently two new ways of obtaining improved Lagrangean bounds have been suggested: Variable splittin...
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a doubl...
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a doubl...
In this thesis a method for solving the Generalized Assignment Problem (GAP) is described. It is bas...
A Lagrangian based heuristic is proposed for many-to-many assignment problems taking into account ca...
AbstractA Lagrangian based heuristic is proposed for many-to-many assignment problems taking into ac...
AbstractWe discuss the relationship between Gilmore–Lawler lower bounds with decomposition for the q...
Lagrangian relaxation is a widely used decomposition approach to solve difficult optimization proble...
Abstract We examine the basis structure of the linear relaxation of the generalized assignment probl...
In this paper we present a generalization and a computational improvement of the Bound Improvement S...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
The assignment problem of matching the elements of two sets at some cost or to some benefit is well ...
We consider a non-linear version of the Generalized Assignment Problem, a well-known strongly NP-har...
AbstractIn 1781 the French mathematician G. Monge gave an optimality criterion and a greedy-like pro...