Buscar
Mostrando ítems 1-5 de 5
A new memetic algorithm for the asymmetric traveling salesman problem
(SpringerDordrechtHolanda, 2004)
A Study of Different Subsequence Elimination Strategies for the Soft Drink Production Planning
(Univ Nacional Autonoma Mexico, 2014-08-01)
The production of soft drinks involves two main stages: syrup preparation and bottling. To obtain the lots sequence in the bottling stage, three approaches are studied. They are based on the sub-tour elimination constraints ...
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 ...
A relax and cut approach using the multi-commodity flow formulation for the traveling salesman problem
(Universidad Nacional de Colombia (Sede Medellín). Facultad de Minas., 2015-05-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 ...