Buscar
Mostrando ítems 1-10 de 67
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 thep-cable-trench problem
(Elsevier, 2015)
Lagrangean relaxation heuristics for thep-cable-trench problem
(Elsevier, 2015)
Un enfoque relax and cut usando una formulación de flujo multiproductos para el problema del agente viajero
(2015-01-01)
In this paper we explore the multi-commodity flow formulation for the Asymmetric Traveling Salesman Problem (ATSP) to obtain dual bounds. The procedure employed is a variant of a relax and cut procedure proposed in the ...
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 ...
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 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 ...
Lagrangean relaxation heuristics for the p-cable-trench problem
(PERGAMON PRESS, 2012)