An adaptive large neighbourhood search algorithm for diameter bounded network design problems
暂无分享,去创建一个
[1] Jean-Charles Régin,et al. Global Constraints: A Survey , 2011 .
[2] Alain Chabrier,et al. Solving a Network Design Problem , 2004, Ann. Oper. Res..
[3] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[4] Yves Deville,et al. CP(Graph): Introducing a Graph Computation Domain in Constraint Programming , 2005, CP.
[5] Jocelyne Elias,et al. Very large-scale neighborhood search algorithms for the design of service overlay networks , 2012, Telecommun. Syst..
[6] Luidi Simonetti,et al. Hop-level flow formulation for the survivable network design with hop constraints problem , 2013, Networks.
[7] Russell Bent,et al. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows , 2006, Comput. Oper. Res..
[8] Massoud Pedram,et al. Constructing Minimal Spanning/Steiner Trees with Bounded Path Length , 1997, Integr..
[9] J. Hurink. An exponential neighborhood for a one-machine batching problem , 1999 .
[10] Michael Segal,et al. Scheduling of Vehicles in Transportation Networks , 2012, Nets4Cars/Nets4Trains.
[11] 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..
[12] Dushyant Sharma,et al. Modeling and solving the rooted distance-constrained minimum spanning tree problem , 2008, Comput. Oper. Res..
[13] Barry O'Sullivan,et al. DISCUS: an end-to-end solution for ubiquitous broadband optical access , 2014, IEEE Communications Magazine.
[14] Michel Gendreau,et al. An Adaptive Large Neighborhood Search for a Vehicle Routing Problem with Multiple Trips , 2010 .