Buscar
Mostrando ítems 1-10 de 33
Benders, metric and cutset inequalities for multicommodity capacitated network design
(SPRINGER, 2009)
Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we ...
Interior point methods for multicommodity network flows
(Pontificia Universidad Católica del PerúPE, 2017)
Lagrangian decomposition methods for large-scale fixed-charge capacitated multicommodity network design problem
(Universidade Federal de Minas GeraisBrasilENG - DEPARTAMENTO DE ENGENHARIA PRODUÇÃOPrograma de Pós-Graduação em Engenharia de ProduçãoUFMG, 2020-09-22)
Tipicamente presente nas áreas de logística e telecomunicações, o problema de síntese de redes multi-fluxo de custo fixo e capacitada permanece desafiador, especialmente quando contextos de grande escala estão envolvidos. ...
Submodularity and combinatorial representations for the multicommodity network design problem
Presentamos una nueva representación combinatoria para el problema de
diseño de redes multiproducto (MUND), tal que su función objetivo satisface
la propiedad de submodularidad. Gracias a la propiedad de submodularidad ...
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 ...
An optimal procedure for solving the hierarchical network design problem
(TAYLOR & FRANCIS INC, 2007)
The hierarchical network design problem consists of finding a minimum cost bilevel network that connects all the nodes in a set, created by a loopless main path and a forest. The main path is formed by primary (higher cost) ...
Lagrangean relaxation heuristics for thep-cable-trench problem
(Elsevier, 2015)