Buscar
Mostrando ítems 51-60 de 272102
Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
(Maik Nauka/interperiodica/springer, 2008-05-01)
Classical and modified Lagrangian bounds for the optimal value of optimization problems with a double decomposable structure are examined. For the class of generalized assignment problems, this property of constraints is ...
The set covering problem solved by the binary teaching-learning-based optimization algorithm [Problema del Conjunto de Cobertura Resuelto Mediante el Algoritmo Binario de Optimización Basado en Enseñanza- Aprendizaje]
(Institute of Electrical and Electronics Engineers Inc., 2015)
Solving biobjective set covering problem using binary cat swarm optimization algorithm
(Springer Verlag, 2016)
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions ...
A NOTE ON A TWO DIMENSIONAL KNAPSACK PROBLEM WITH UNLOADING CONSTRAINTS
(Edp Sciences S ALes Ulis Cedex AFrança, 2013)
Classification and literature review of integrated lot-sizing and cutting stock problems
(2018-11-16)
The aim of this paper is to classify the literature related to the integration between the lot-sizing and cutting stock problem. A deterministic mathematical model, that considers multiple dimensions of integration and ...
Comparison of Lagrangian Bounds for One Class of Generalized Assignment Problems
(Maik Nauka/interperiodica/springer, 2014)