Identifying the Pareto-Optimal Solutions for Multi-point Distance Minimization Problem in Manhattan Space
暂无分享,去创建一个
[1] Mario Köppen,et al. Many-Objective Particle Swarm Optimization by Gradual Leader Selection , 2007, ICANNGA.
[2] Yacov Y. Haimes,et al. Multiobjective Decision Making: Theory and Methodology , 1983 .
[3] Sang Won Bae,et al. Computing minimum-area rectilinear convex hull and L-shape , 2009, Comput. Geom..
[4] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[5] Kalyanmoy Deb,et al. Unveiling innovative design principles by means of multiple conflicting objectives , 2003 .
[6] Sanaz Mostaghim,et al. Properties of scalable distance minimization problems using the Manhattan metric , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).
[7] David Eppstein,et al. Optimally Fast Incremental Manhattan Plane Embedding and Planar Tight Span Construction , 2009, J. Comput. Geom..
[8] Thanasis Hadzilacos,et al. Advances in Spatial and Temporal Databases , 2003, Lecture Notes in Computer Science.
[9] Derick Wood,et al. On the Definition and Computation of Rectlinear Convex Hulls , 1984, Inf. Sci..
[10] Hisao Ishibuchi,et al. A many-objective test problem for visually examining diversity maintenance behavior in a decision space , 2011, GECCO '11.
[11] Mark H. Overmars,et al. Scanline algorithms on a grid , 1988, BIT.
[12] Peter J. Fleming,et al. On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers , 1996, PPSN.