Buscar
Mostrando ítems 1-10 de 36
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 ...
A Relax-and-Cut algorithm for the set partitioning problem
(Pergamon-elsevier Science LtdOxfordInglaterra, 2008)
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2005-06-01)
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is ...
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2005-06-01)
This paper describes a branch-and-price algorithm for the p-median location problem. The objective is to locate p facilities (medians) such as the sum of the distances from each demand point to its nearest facility is ...
A relaxação Lagrangeana/surrogate e o método de geração de colunas: novos limitantes e novas colunas
(Sociedade Brasileira de Pesquisa Operacional, 2003-01)
Column generation and Dantzig-Wolfe decomposition are very successful methods for large-scale linear programming problems. It is also well known the instability of the overall process. Stabilizing methods work constraining ...
A column generation approach for the maximal covering location problem
(2007-01-01)
This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p-median problem. This reformulation leads to instances that ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2004-05-01)
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2004-05-01)
The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation ...
A column generation approach to capacitated p-median problems
(Elsevier B.V., 2014)
A branch-and-price approach to p-median location problems
(Elsevier B.V., 2014)