Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints
暂无分享,去创建一个
[1] Gilbert Laporte,et al. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints , 1991, Oper. Res. Lett..
[2] Luís Gouveia,et al. A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem , 1995, Oper. Res..
[3] Bezalel Gavish,et al. Topological design of centralized computer networks - formulations and algorithms , 1982, Networks.
[4] P. Bhave,et al. Integer programming formulations of vehicle routing problems , 1985 .
[5] Martin W. P. Savelsbergh,et al. Edge exchanges in the degree-constrained minimum spanning tree problem , 1985, Comput. Oper. Res..
[6] R. Prim. Shortest connection networks and some generalizations , 1957 .
[7] Philip Wolfe,et al. Validation of subgradient optimization , 1974, Math. Program..
[8] M. Savelsbergh,et al. Edge exchanges in the degree-constrained spanning tree problem , 1985 .
[9] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[10] Gilbert Laporte. Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave , 1989 .
[11] Bhaba R. Sarker,et al. Discrete location theory , 1991 .
[12] Bezalel Gavish,et al. Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..