Buscar
Mostrando ítems 1-10 de 39
Lagrangean relaxation heuristics for thep-cable-trench problem
(Elsevier, 2015)
Lagrangean relaxation heuristics for thep-cable-trench problem
(Elsevier, 2015)
Lagrangean relaxation heuristics for the p-cable-trench problem
(PERGAMON-ELSEVIER SCIENCE LTD, 2012)
We address the p-cable-trench problem. In this problem, p facilities are located, a trench network is dug and cables are laid in the trenches, so that every customer - or demand - in the region is connected to a facility ...
Survivable capacitated network design problem: new formulation and Lagrangean relaxation
(PALGRAVE MACMILLAN LTD, 2000)
This work is focused on the analysis of the survivable capacitated network design problem. This problem can be stated as follows: Given a supply network with point-to-point traffic demands, specific survivability requirements, ...
Lagrangean relaxation heuristics for the p-cable-trench problem
(PERGAMON PRESS, 2012)
Métodos exatos baseados em relaxação lagrangiana e surrogate para o problema de carregamento de paletes do produtor.
(Universidade Federal de São CarlosBRUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEP, 2004-12-13)
The purpose of this work is to develop exact methods, based on
Lagrangean and Surrogate relaxation, with good performance to solve the
manufacturer s pallet loading problem. This problem consists of orthogonally arranging
the ...
Lagrangean relaxation for the geographical partitioning problemRelajacion lagrangeana para el problema de particionamiento de áreas geográficas
(Universidad de Costa Rica, Centro de Investigación en Matemática Pura y Aplicada (CIMPA), 2012)
Abordagens de otimização para o problema de alocação dinâmica de veículos no contexto de transporte rodoviário de carga no Brasil
(Universidade Federal de São CarlosUFSCarPrograma de Pós-Graduação em Engenharia de Produção - PPGEPCâmpus São Carlos, 2017-03-10)
This work aims at treating the Dynamic Vehicle Allocation Problem (DVAP) in the context of the Brazilian Freight Transportation system. The problem consists of allocating empty vehicles to different terminals so as to ...