메뉴 건너뛰기




Volumn 34, Issue 4, 2009, Pages 837-858

Locating Objects in the Plane Using Global Optimization Techniques

Author keywords

Computational metrology; DC optimization; Global optimization; Location of objects

Indexed keywords

BRANCH AND BOUNDS; COMPUTATIONAL METROLOGY; CONVEX SET; DC OPTIMIZATION; GLOBAL OPTIMIZATION PROBLEMS; GLOBAL OPTIMIZATION TECHNIQUES; MODEL YIELDS; OBNOXIOUS FACILITIES; OUTER APPROXIMATION; PERFORMANCE MEASURE;

EID: 73249134113     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1090.0406     Document Type: Article
Times cited : (11)

References (86)
  • 1
    • 0028375715 scopus 로고
    • Planar geometric location problems
    • Agarwal, P. K., M. Sharir. 1994. Planar geometric location problems. Algorithmica 11 185-195.
    • (1994) Algorithmica , vol.11 , pp. 185-195
    • Agarwal, P.K.1    Sharir, M.2
  • 4
    • 0001078023 scopus 로고
    • Computing a segment center for a planar point set
    • Agarwal, P. K., A. Efrat, M. Sharir, S. Toledo. 1993. Computing a segment center for a planar point set. J. Algorithms 15 314-323.
    • (1993) J. Algorithms , vol.15 , pp. 314-323
    • Agarwal, P.K.1    Efrat, A.2    Sharir, M.3    Toledo, S.4
  • 5
    • 1542380919 scopus 로고    scopus 로고
    • An, L. T. H., P. D. Tao. 2003. Large-scale molecular optimization from distance matrices by a D.C. optimization approach. SIAM J. Optim. 14 77-114.
    • An, L. T. H., P. D. Tao. 2003. Large-scale molecular optimization from distance matrices by a D.C. optimization approach. SIAM J. Optim. 14 77-114.
  • 6
    • 15244346000 scopus 로고    scopus 로고
    • The DC (difference of convex functions) programming and DCA revisited with DC models of real-world nonconvex optimization problems
    • An, L. T. H., P. D. Tao. 2005. The DC (difference of convex functions) programming and DCA revisited with DC models of real-world nonconvex optimization problems. Ann. Oper. Res. 133 23-46.
    • (2005) Ann. Oper. Res , vol.133 , pp. 23-46
    • An, L.T.H.1    Tao, P.D.2
  • 7
    • 0242689032 scopus 로고    scopus 로고
    • On covering methods for DC optimization
    • Blanquero, R., E. Carrizosa. 2000. On covering methods for DC optimization. J. Global Optim. 18 265-274.
    • (2000) J. Global Optim , vol.18 , pp. 265-274
    • Blanquero, R.1    Carrizosa, E.2
  • 8
    • 0034348647 scopus 로고    scopus 로고
    • Optimization of the norm of a vector-valued DC function and applications
    • Blanquero, R., E. Carrizosa. 2000. Optimization of the norm of a vector-valued DC function and applications. J. Optim. Theory Appl. 107 245-260.
    • (2000) J. Optim. Theory Appl , vol.107 , pp. 245-260
    • Blanquero, R.1    Carrizosa, E.2
  • 9
    • 33645149609 scopus 로고    scopus 로고
    • A D.C. biobjective location model
    • Blanquero, R., E. Carrizosa. 2002. A D.C. biobjective location model. J. Global Optim. 23 139-154.
    • (2002) J. Global Optim , vol.23 , pp. 139-154
    • Blanquero, R.1    Carrizosa, E.2
  • 10
    • 70349675894 scopus 로고    scopus 로고
    • Continuous location problems and big triangle small triangle: Constructing better bounds
    • DOI 10.1007/s10898-008- 9381-z
    • Blanquero, R., E. Carrizosa. 2008. Continuous location problems and big triangle small triangle: Constructing better bounds. J. Global Optim. http://www.springerlink.com/content/t8322883354940ur/, DOI 10.1007/s10898-008- 9381-z.
    • (2008) J. Global Optim
    • Blanquero, R.1    Carrizosa, E.2
  • 11
    • 0036877310 scopus 로고    scopus 로고
    • Linear facility location in three dimensions-Models and solution methods
    • Brimberg, J., H. Juel, A. Schöbel. 2002. Linear facility location in three dimensions-Models and solution methods. Oper. Res. 50 1050-1057.
    • (2002) Oper. Res , vol.50 , pp. 1050-1057
    • Brimberg, J.1    Juel, H.2    Schöbel, A.3
  • 12
    • 73249142546 scopus 로고    scopus 로고
    • Locating a circle on the plane using the minimax criterion
    • September
    • Brimberg, J., H. Juel, A. Schobel. 2009. Locating a circle on the plane using the minimax criterion. Stud. Locational Anal., Issue 17(September).
    • (2009) Stud. Locational Anal , Issue.17
    • Brimberg, J.1    Juel, H.2    Schobel, A.3
  • 13
    • 38549136890 scopus 로고    scopus 로고
    • Locating a circle on a sphere
    • Brimberg, J., H. Juel, A. Schöbel. 2007. Locating a circle on a sphere. Oper. Res. 55 782-791.
    • (2007) Oper. Res , vol.55 , pp. 782-791
    • Brimberg, J.1    Juel, H.2    Schöbel, A.3
  • 15
    • 27844435373 scopus 로고    scopus 로고
    • Decomposition methods for solving nonconvex quadratic programs via branch and bound
    • Cambini, R., C. Sodini. 2005. Decomposition methods for solving nonconvex quadratic programs via branch and bound. J. Global Optim. 33 313-336.
    • (2005) J. Global Optim , vol.33 , pp. 313-336
    • Cambini, R.1    Sodini, C.2
  • 16
    • 0001885178 scopus 로고    scopus 로고
    • Location of semi-obnoxious facilities
    • Carrizosa, E., F. Plastria. 1999. Location of semi-obnoxious facilities. Stud. Locat. Anal. 12 1-27.
    • (1999) Stud. Locat. Anal , vol.12 , pp. 1-27
    • Carrizosa, E.1    Plastria, F.2
  • 17
    • 0030535803 scopus 로고    scopus 로고
    • Approximation of polygonal curves with minimum number of line segments or minimun error
    • Chan, W. S., F. Chin. 1996. Approximation of polygonal curves with minimum number of line segments or minimun error. Internat. J. Comput. Geom. Appl. 6 59-77.
    • (1996) Internat. J. Comput. Geom. Appl , vol.6 , pp. 59-77
    • Chan, W.S.1    Chin, F.2
  • 18
    • 0027087908 scopus 로고
    • Weber's problem with attraction and repulsion
    • Chen, P. C., P. Hansen, B. Jaumard, H. Tuy. 1992. Weber's problem with attraction and repulsion. J. Regional Sci. 32 467-486.
    • (1992) J. Regional Sci , vol.32 , pp. 467-486
    • Chen, P.C.1    Hansen, P.2    Jaumard, B.3    Tuy, H.4
  • 19
    • 0032114729 scopus 로고    scopus 로고
    • Solution of the multisource Weber and conditional Weber problems by D.-C. programming
    • Chen, P. C., P. Hansen, B. Jaumard, H. Tuy. 1998. Solution of the multisource Weber and conditional Weber problems by D.-C. programming. Oper. Res. 46 548-562.
    • (1998) Oper. Res , vol.46 , pp. 548-562
    • Chen, P.C.1    Hansen, P.2    Jaumard, B.3    Tuy, H.4
  • 20
    • 0038430387 scopus 로고    scopus 로고
    • Global optimization problem with multiple reverse convex constraints and its application to out-of-roundness problem
    • Dai, Y., J. Shi, Y. Yamamoto. 1996. Global optimization problem with multiple reverse convex constraints and its application to out-of-roundness problem. J. Oper. Res. Soc. Japan 39 356-371.
    • (1996) J. Oper. Res. Soc. Japan , vol.39 , pp. 356-371
    • Dai, Y.1    Shi, J.2    Yamamoto, Y.3
  • 22
  • 23
    • 0006861842 scopus 로고    scopus 로고
    • Location of rectilinear center trajectories
    • Díaz-Báñez, J. M., J. A. Mesa. 1998. Location of rectilinear center trajectories. Top 6 159-177.
    • (1998) Top , vol.6 , pp. 159-177
    • Díaz-Báñez, J.M.1    Mesa, J.A.2
  • 24
    • 18044399255 scopus 로고    scopus 로고
    • Fitting rectilinear paths to a set of points in the plane
    • Díaz-Báñez, J. M., J. A. Mesa. 2001. Fitting rectilinear paths to a set of points in the plane. Eur. J. Oper. Res. 130 214-222.
    • (2001) Eur. J. Oper. Res , vol.130 , pp. 214-222
    • Díaz-Báñez, J.M.1    Mesa, J.A.2
  • 26
    • 33846107929 scopus 로고    scopus 로고
    • A general global optimization approach for solving location problems in the plane
    • Drezner, Z. 2007. A general global optimization approach for solving location problems in the plane. J. Global Optim. 37 305-319.
    • (2007) J. Global Optim , vol.37 , pp. 305-319
    • Drezner, Z.1
  • 27
  • 29
    • 0021899999 scopus 로고
    • Finding transversals for sets of simple geometric figures
    • Edelsbrunner, H. 1985. Finding transversals for sets of simple geometric figures. Theoret. Comput. Sci. 35 55-69.
    • (1985) Theoret. Comput. Sci , vol.35 , pp. 55-69
    • Edelsbrunner, H.1
  • 30
    • 0030492048 scopus 로고    scopus 로고
    • A near-linear algorithm for the planar segment-center problem
    • Efrat, A., M. Sharir. 1996. A near-linear algorithm for the planar segment-center problem. Discrete Comput. Geom. 16 239-257.
    • (1996) Discrete Comput. Geom , vol.16 , pp. 239-257
    • Efrat, A.1    Sharir, M.2
  • 32
    • 34249771766 scopus 로고
    • Least squares fitting of circles and ellipses
    • Gander, W., G. H. Golub, R. Strebel. 1994. Least squares fitting of circles and ellipses. BIT 34 558-578.
    • (1994) BIT , vol.34 , pp. 558-578
    • Gander, W.1    Golub, G.H.2    Strebel, R.3
  • 34
    • 0141556890 scopus 로고    scopus 로고
    • Fitting circles and spheres to coordinate measuring machine data
    • F. Giannessi, T. Rapcsak, S. Komlósic, eds, Kluwer Academic Publishers, Dordrecht, The Netherlands
    • Gass, S. I., C. Witzgall, H. H. Harary. 1998. Fitting circles and spheres to coordinate measuring machine data. F. Giannessi, T. Rapcsak, S. Komlósic, eds. New Trends in Math. Program. Kluwer Academic Publishers, Dordrecht, The Netherlands, 65-92.
    • (1998) New Trends in Math. Program , pp. 65-92
    • Gass, S.I.1    Witzgall, C.2    Harary, H.H.3
  • 35
    • 21844521630 scopus 로고
    • Efficient piecewise-linear function approximation using the uniform metric
    • Goodrich, M. T. 1995. Efficient piecewise-linear function approximation using the uniform metric. Discrete Comput. Geometry 14 445-462.
    • (1995) Discrete Comput. Geometry , vol.14 , pp. 445-462
    • Goodrich, M.T.1
  • 38
    • 84972497490 scopus 로고
    • On functions representable as a difference of convex functions
    • Hartman, P., 1959. On functions representable as a difference of convex functions. Pacific J. Math. 9 707-713.
    • (1959) Pacific J. Math , vol.9 , pp. 707-713
    • Hartman, P.1
  • 39
    • 0001780949 scopus 로고
    • Generalized differentiability, duality, and optimization for problems dealing with differences of convex functions
    • J. Ponstein, ed, Springer-Verlag, Berlin
    • Hiriart-Urruty, J. B. 1986. Generalized differentiability, duality, and optimization for problems dealing with differences of convex functions. J. Ponstein, ed. Lecture Notes in Economics and Mathematical Systems, Vol. 256. Springer-Verlag, Berlin, 37-69.
    • (1986) Lecture Notes in Economics and Mathematical Systems , vol.256 , pp. 37-69
    • Hiriart-Urruty, J.B.1
  • 40
    • 0346129939 scopus 로고    scopus 로고
    • A production-transportation problem with stochastic demand and concave production costs
    • Holmberg, K., H. Tuy. 1999. A production-transportation problem with stochastic demand and concave production costs. Math. Programming 85 157-179.
    • (1999) Math. Programming , vol.85 , pp. 157-179
    • Holmberg, K.1    Tuy, H.2
  • 45
    • 85012762552 scopus 로고
    • Polygonal approximations of a curve-formulation and algorithms
    • G. T. Toussaint, ed, North-Holland, Amsterdam
    • Imai, H., M. Iri. 1988. Polygonal approximations of a curve-formulation and algorithms. G. T. Toussaint, ed. Computational Morphology. North-Holland, Amsterdam, 71-86.
    • (1988) Computational Morphology , pp. 71-86
    • Imai, H.1    Iri, M.2
  • 47
    • 0029499805 scopus 로고
    • Optimal location of routes for vehicles transporting hazardous materials
    • Karkazis, J., T. B. Boffey. 1995. Optimal location of routes for vehicles transporting hazardous materials. Eur. J. Oper. Res. 86 201-215.
    • (1995) Eur. J. Oper. Res , vol.86 , pp. 201-215
    • Karkazis, J.1    Boffey, T.B.2
  • 48
    • 23944474153 scopus 로고    scopus 로고
    • Optimization of a long-short portfolio under nonconvex transaction cost
    • Konno, H., K. Akishino, R. Yamamoto. 2005. Optimization of a long-short portfolio under nonconvex transaction cost. Comput. Optim. Appl. 32 115-132.
    • (2005) Comput. Optim. Appl , vol.32 , pp. 115-132
    • Konno, H.1    Akishino, K.2    Yamamoto, R.3
  • 50
    • 0000658303 scopus 로고
    • Assessing topological configuration for rapid transit networks
    • Laporte, G., J. A. Mesa, F. Ortega. 1994. Assessing topological configuration for rapid transit networks. Stud. Locational Anal. 7 105-121.
    • (1994) Stud. Locational Anal , vol.7 , pp. 105-121
    • Laporte, G.1    Mesa, J.A.2    Ortega, F.3
  • 51
    • 0026118495 scopus 로고
    • Out-of-roundness problem revisited
    • Le, V. B., D. T. Lee. 1991. Out-of-roundness problem revisited. IEEE Trans. Pattern Anal. 13 217-223.
    • (1991) IEEE Trans. Pattern Anal , vol.13 , pp. 217-223
    • Le, V.B.1    Lee, D.T.2
  • 52
    • 0023012607 scopus 로고
    • Geometric complexity of some location problems
    • Lee, D. T., Y. F. Wu. 1986. Geometric complexity of some location problems. Algorithmica 1 193-211.
    • (1986) Algorithmica , vol.1 , pp. 193-211
    • Lee, D.T.1    Wu, Y.F.2
  • 54
    • 0035965411 scopus 로고    scopus 로고
    • Median and center hyperplanes in Minkowski spaces - A unifying approach
    • Martini, H., A. Schöbel. 2001. Median and center hyperplanes in Minkowski spaces - A unifying approach. Discrete Math. 241 407-426.
    • (2001) Discrete Math , vol.241 , pp. 407-426
    • Martini, H.1    Schöbel, A.2
  • 55
    • 84977338359 scopus 로고
    • A new approach to network generation and map representation: The linear case of the location-allocation problem
    • McKinnon, R. D., G. M. Barber. 1972. A new approach to network generation and map representation: The linear case of the location-allocation problem. Geographical Anal. 4 156-168.
    • (1972) Geographical Anal , vol.4 , pp. 156-168
    • McKinnon, R.D.1    Barber, G.M.2
  • 56
    • 0020202861 scopus 로고
    • On the complexity of locating linear facilities in the plane
    • Megiddo, N., A. Tamir. 1982. On the complexity of locating linear facilities in the plane. Oper. Res. Lett. 1 194-197.
    • (1982) Oper. Res. Lett , vol.1 , pp. 194-197
    • Megiddo, N.1    Tamir, A.2
  • 58
    • 85023368831 scopus 로고
    • On polygonal chain approximation
    • G. T. Toussaint, ed, North-Holland, Amsterdam
    • Melkman, A., J. O'Rourke. 1988. On polygonal chain approximation. G. T. Toussaint, ed. Computational Morphology. North-Holland, Amsterdam, 87-95.
    • (1988) Computational Morphology , pp. 87-95
    • Melkman, A.1    O'Rourke, J.2
  • 59
    • 0002663240 scopus 로고
    • The mathematics of the continuous location
    • Michelot. C. 1993. The mathematics of the continuous location. Stud. Locational Anal. 5 59-83.
    • (1993) Stud. Locational Anal , vol.5 , pp. 59-83
    • Michelot, C.1
  • 60
    • 0001943379 scopus 로고
    • A simple approach to linear facility location
    • Morris, J. G., J. P. Norback. 1983. A simple approach to linear facility location. Transportation Sci. 14 1-8.
    • (1983) Transportation Sci , vol.14 , pp. 1-8
    • Morris, J.G.1    Norback, J.P.2
  • 61
    • 0038499781 scopus 로고
    • Linear facility location-solving extensions on the basic problems
    • Morris, J. G., J. P. Norback. 1983. Linear facility location-solving extensions on the basic problems. Eur. J. Oper. Res. 12 90-94.
    • (1983) Eur. J. Oper. Res , vol.12 , pp. 90-94
    • Morris, J.G.1    Norback, J.P.2
  • 62
    • 0000238336 scopus 로고
    • A simplex method for function minimization
    • Nelder, J. A., R. Mead. 1964. A simplex method for function minimization. Comput. J. 7 308-313.
    • (1964) Comput. J , vol.7 , pp. 308-313
    • Nelder, J.A.1    Mead, R.2
  • 63
    • 0036013083 scopus 로고    scopus 로고
    • A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres
    • Nievergelt, Y. 2002. A finite algorithm to fit geometrically all midrange lines, circles, planes, spheres, hyperplanes, and hyperspheres. Numer. Math. 91 257-303.
    • (2002) Numer. Math , vol.91 , pp. 257-303
    • Nievergelt, Y.1
  • 64
    • 0001196985 scopus 로고
    • Fitting hyperplanes by minimizing orthogonal deviations
    • Norback, J. P., J. G. Morris. 1980. Fitting hyperplanes by minimizing orthogonal deviations. Math. Programming 19 102-105.
    • (1980) Math. Programming , vol.19 , pp. 102-105
    • Norback, J.P.1    Morris, J.G.2
  • 65
    • 0035536118 scopus 로고    scopus 로고
    • Gauge-distances and median hyperplanes
    • Plastria, F., E. Carrizosa. 2001. Gauge-distances and median hyperplanes. J. Optim. Theory Appl. 110 173-182.
    • (2001) J. Optim. Theory Appl , vol.110 , pp. 173-182
    • Plastria, F.1    Carrizosa, E.2
  • 66
    • 0141556886 scopus 로고
    • Approximation by circles
    • Rivlin, T. J. 1972. Approximation by circles. Computing 1 93-104.
    • (1972) Computing , vol.1 , pp. 93-104
    • Rivlin, T.J.1
  • 67
    • 0041305423 scopus 로고
    • Linear approximation of simple objects
    • Robert, J. M., G. T. Toussaint. 1994. Linear approximation of simple objects. Comput. Geometry 4 27-52.
    • (1994) Comput. Geometry , vol.4 , pp. 27-52
    • Robert, J.M.1    Toussaint, G.T.2
  • 68
    • 0004267646 scopus 로고
    • Princeton University Press, Princeton, NJ
    • Rockafellar, R. T. 1970. Convex Analysis. Princeton University Press, Princeton, NJ.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1
  • 69
    • 0038499769 scopus 로고    scopus 로고
    • Locating least-distant lines with block norms
    • Schöbel, A. 1996. Locating least-distant lines with block norms. Stud. Locational Anal. 10 139-150.
    • (1996) Stud. Locational Anal , vol.10 , pp. 139-150
    • Schöbel, A.1
  • 70
    • 0000581619 scopus 로고    scopus 로고
    • Locating least distant lines in the plane
    • Schöbel, A. 1998. Locating least distant lines in the plane. Eur. J. Oper. Res. 106 152-159.
    • (1998) Eur. J. Oper. Res , vol.106 , pp. 152-159
    • Schöbel, A.1
  • 72
    • 0041705339 scopus 로고    scopus 로고
    • Solving restricted line location problems via a dual interpretation
    • Schöbel, A. 1999. Solving restricted line location problems via a dual interpretation. Discrete Appl. Math. 93 109-125.
    • (1999) Discrete Appl. Math , vol.93 , pp. 109-125
    • Schöbel, A.1
  • 74
    • 0030406912 scopus 로고    scopus 로고
    • Least-squares fitting by circles
    • Späth, H. 1996. Least-squares fitting by circles. Computing 57 179-185.
    • (1996) Computing , vol.57 , pp. 179-185
    • Späth, H.1
  • 75
    • 0040454920 scopus 로고    scopus 로고
    • Least-squares fitting of ellipses and hyperbolas
    • Späth, H. 1997. Least-squares fitting of ellipses and hyperbolas. Comput. Statist. 12 329-341.
    • (1997) Comput. Statist , vol.12 , pp. 329-341
    • Späth, H.1
  • 77
    • 0040294768 scopus 로고    scopus 로고
    • How tall is the pyramid of Cheops?. and other problems in computational metrology
    • Srinivasan, V. 1996. How tall is the pyramid of Cheops?. and other problems in computational metrology. SIAM News 8 64-72.
    • (1996) SIAM News , vol.8 , pp. 64-72
    • Srinivasan, V.1
  • 78
    • 73249147699 scopus 로고    scopus 로고
    • Tuy, H. 1995. D.C. optimization: Theory, methods and algorithms. R. Horst, P. M. Pardalos, eds. Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 149-216.
    • Tuy, H. 1995. D.C. optimization: Theory, methods and algorithms. R. Horst, P. M. Pardalos, eds. Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht, The Netherlands, 149-216.
  • 79
    • 0002048391 scopus 로고
    • Canonical DC programming problem: Outer approximation methods revisited
    • Tuy, H. 1995. Canonical DC programming problem: Outer approximation methods revisited. Oper. Res. Lett. 18 99-106.
    • (1995) Oper. Res. Lett , vol.18 , pp. 99-106
    • Tuy, H.1
  • 81
    • 0010707492 scopus 로고
    • A D.C. optimization method for single facility location problems
    • Tuy, H., F. Al-Khayyal, F. Zhou. 1995. A D.C. optimization method for single facility location problems. J. Global Optim. 7 209-227.
    • (1995) J. Global Optim , vol.7 , pp. 209-227
    • Tuy, H.1    Al-Khayyal, F.2    Zhou, F.3
  • 82
    • 0024962155 scopus 로고
    • The minimax center estimation problem for automated roundness inspection
    • Ventura, J. A., S. Yeralan. 1989. The minimax center estimation problem for automated roundness inspection. Eur. J. Oper. Res. 41 64-72.
    • (1989) Eur. J. Oper. Res , vol.41 , pp. 64-72
    • Ventura, J.A.1    Yeralan, S.2
  • 83
    • 0001351879 scopus 로고
    • Linear programming techniques for regression analysis
    • Wagner, H. M. 1959. Linear programming techniques for regression analysis. J. Amer. Statist. Assoc. 54 206-212.
    • (1959) J. Amer. Statist. Assoc , vol.54 , pp. 206-212
    • Wagner, H.M.1
  • 84
    • 0004145937 scopus 로고
    • Oxford University Press, Oxford, UK
    • Webster, R. 1994. Convexity. Oxford University Press, Oxford, UK.
    • (1994) Convexity
    • Webster, R.1
  • 86
    • 0042068919 scopus 로고    scopus 로고
    • Applications of orthogonal distance regression in metrology
    • S. Van Huffel, ed, SIAM, Philadelphia
    • Zwick. S. 1997. Applications of orthogonal distance regression in metrology. S. Van Huffel, ed. Recent Advances in Total Least Squares and Errors-in-Variables Modeling. SIAM, Philadelphia, 265-272.
    • (1997) Recent Advances in Total Least Squares and Errors-in-Variables Modeling , pp. 265-272
    • Zwick, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.