Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem
暂无分享,去创建一个
[1] Peter Eades,et al. On Optimal Trees , 1981, J. Algorithms.
[2] Prabhu Manyem. Constrained spanning, Steiner trees and the triangle inequality , 2009 .
[3] Ivana Ljubic,et al. A Hybrid VNS for Connected Facility Location , 2007, Hybrid Metaheuristics.
[4] Mohammad Mahdian,et al. Approximation Algorithms for Metric Facility Location Problems , 2006, SIAM J. Comput..
[5] Markus Leitner,et al. Branch-and-Cut-and-Price for Capacitated Connected Facility Location , 2011, J. Math. Model. Algorithms.
[6] Kemal Altinkemer,et al. Using a Hop-Constrained Model to Generate Alternative Communication Network Design , 2015, INFORMS J. Comput..
[7] Rajkumar Buyya,et al. A Taxonomy of CDNs , 2008 .
[8] Jozef Kratica,et al. Solving the simple plant location problem by genetic algorithm , 2001, RAIRO Oper. Res..
[9] Luís Gouveia,et al. On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem , 2006, Handbook of Optimization in Telecommunications.
[10] Tobias Achterberg,et al. SCIP: solving constraint integer programs , 2009, Math. Program. Comput..
[11] Andrew V. Goldberg,et al. On Implementing the Push—Relabel Method for the Maximum Flow Problem , 1997, Algorithmica.
[12] S. Voß,et al. The Steiner tree problem with hop constraints , 1999, Ann. Oper. Res..
[13] Luís Gouveia,et al. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..
[14] Alysson M. Costa,et al. Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints , 2009, Networks.
[15] L. Wolsey,et al. Chapter 9 Optimal trees , 1995 .
[16] Noga Alon,et al. Algorithmic construction of sets for k-restrictions , 2006, TALG.
[17] L. Gouveia. Multicommodity flow models for spanning trees with hop constraints , 1996 .
[18] S. Raghavan,et al. Dual-Based Local Search for the Connected Facility Location and Related Problems , 2010, INFORMS J. Comput..
[19] George C. Polyzos,et al. Multicast routing for multimedia communication , 1993, TNET.
[20] Brunilde Sansò,et al. Telecommunications Network Planning , 1998 .
[21] Alysson M. Costa,et al. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints , 2008, Eur. J. Oper. Res..
[22] Matthias F. Stallmann,et al. Some Approximation Results in Multicasting , 1996 .
[23] Panos M. Pardalos,et al. Handbook of Optimization in Telecommunications , 2006 .
[24] Luis Gouveia,et al. Using Hop-Indexed Models For Constrained Spanning and Steiner Tree Models , 1999 .
[25] Günther R. Raidl,et al. A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems , 2011, IPCO.
[26] Friedrich Eisenbrand,et al. Connected facility location via random facility sampling and core detouring , 2010, J. Comput. Syst. Sci..
[27] Harald Räcke,et al. Approximation algorithms for data management in networks , 2001, SPAA.
[28] John E. Beasley,et al. OR-Library: Distributing Test Problems by Electronic Mail , 1990 .
[29] Ivana Ljubić,et al. MIP Models for ( Hop-Constrained ) Connected Facility Location , 2009 .
[30] Rajkumar Buyya,et al. Content Delivery Networks , 2008 .
[31] Ivana Ljubic,et al. MIP models for connected facility location: A theoretical and computational study☆ , 2011, Comput. Oper. Res..
[32] Ivana Ljubic,et al. A GRASP Algorithm for the Connected Facility Location Problem , 2008, 2008 International Symposium on Applications and the Internet.
[33] Luís Gouveia,et al. Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..
[34] Thorsten Koch,et al. Solving Steiner tree problems in graphs to optimality , 1998, Networks.