A New Modeling for Finding Optimal Weighted Distances
暂无分享,去创建一个
[1] Ovidiu Daescu,et al. Minimum Separation in Weighted Subdivisions , 2009, Int. J. Comput. Geom. Appl..
[2] Joseph S. B. Mitchell,et al. An Experimental Study of Weighted k-Link Shortest Path Algorithms , 2006, WAFR.
[3] Xiaobo Sharon Hu,et al. Optimal Beam Penetrations in Two and Three Dimensions , 2000, ISAAC.
[4] Ovidiu Daescu,et al. Line Facility Location in Weighted Regions , 2008, AAIM.
[5] R. Chandrasekaran,et al. Stock cutting to minimize cutting length , 1996 .
[6] Timothy M. Chan. Deterministic algorithms for 2-d convex programming and 3-d online linear programming , 1997, SODA '97.
[7] Joseph S. B. Mitchell,et al. k-Link Shortest Paths in Weighted Subdivisions , 2005, WADS.
[8] Susan W. Palocsay,et al. Optimizing the sum of linear fractional functions , 1992 .
[9] Ovidiu Daescu. Parallel Optimal Weighted Links , 2001, International Conference on Computational Science.
[10] Ovidiu Daescu,et al. Finding optimal weighted bridges with applications , 2006, ACM-SE 44.
[11] Xiaodong Wu,et al. Determining an Optimal Penetration Among Weighted Regions in Two and Three Dimensions , 1999, SCG '99.
[12] Xiaobo Sharon Hu,et al. Computing Optimal Beams in Two and Three Dimensions , 2003, J. Comb. Optim..
[13] Martin E. Dyer,et al. A class of convex programs with applications to computational geometry , 1992, SCG '92.
[14] Xiaodong Wu,et al. Efficient Algorithms and Implementations for Optimizing the Sum of Linear Fractional Functions, with Applications , 2005, J. Comb. Optim..