A Bi-Objective Median Location ProblemWith a Line Barrier
暂无分享,去创建一个
[1] George O. Wesolowsky,et al. THE WEBER PROBLEM: HISTORY AND PERSPECTIVES. , 1993 .
[2] L. Cooper,et al. Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle , 1981 .
[3] Siegfried Helbig,et al. On a constructive approximation of the efficient outcomes in bicriterion vector optimization , 1994, J. Glob. Optim..
[4] M. Shirosaki. Another proof of the defect relation for moving targets , 1991 .
[5] R. S. Laundy,et al. Multiple Criteria Optimisation: Theory, Computation and Application , 1989 .
[6] Horst W. Hamacher. Mathematische Lösungsverfahren für planare Standortprobleme , 1995 .
[7] Georges M. Fadel,et al. Approximating Pareto curves using the hyper-ellipse , 1998 .
[8] Mahmut Parlar,et al. Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel , 1994, Transp. Sci..
[9] Malgorzata M. Wiecek,et al. An Augmented Lagrangian Scalarization for Multiple Objective Programming , 1997 .
[10] Rajan Batta,et al. Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions , 1989, Transp. Sci..
[11] Steven E. Butt,et al. An efficient algorithm for facility location in the presence of forbidden regions , 1996 .
[12] Horst W. Hamacher,et al. Optimal bin location and sequencing in printed circuit board assembly , 1993 .
[13] Richard C. Larson,et al. Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel , 1983, Oper. Res..
[14] H. Hamacher,et al. Combinatorial algorithms for some 1-facility median problems in the plane , 1994 .
[15] A. Payne,et al. Efficient approximate representation of bi-objective tradeoff sets , 1993 .
[16] G. R. Bitran,et al. The structure of admissible points with respect to cone dominance , 1979 .
[17] Johannes Jahn,et al. Reference point approximation method for the solution of bicriterial nonlinear optimization problems , 1992 .
[18] Horst W. Hamacher,et al. Classification of Location Problems , 1999 .
[19] C. Goh,et al. A method for convex curve approximation , 1997 .
[20] H. Hamacher,et al. Multicriteria planar location problems , 1996 .
[21] M. Labbé,et al. Multicriteria network location problems with sum objectives , 1999 .
[22] Arthur M. Geoffrion,et al. Solving Bicriterion Mathematical Programs , 1967, Oper. Res..
[23] Frank Plastria,et al. Continuous Location Problems , 1995 .
[24] Stefan Nickel,et al. A Flexible Approach to Piecewise Linear Multiple Objective Programming , 1997 .
[25] A. Warburton. Quasiconcave vector maximization: Connectedness of the sets of Pareto-optimal and weak Pareto-optimal alternatives , 1983 .
[26] Horst W. Hamacher,et al. Classification of location models , 1998 .
[27] John Hershberger,et al. Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..
[28] Horst W. Hamacher,et al. Restricted planar location problems and applications , 1995 .
[29] K. Klamroth. Planar weber location problems with line barriers , 2001 .