One-Center Location With Block and Euclidean Distance

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

One-Center Location With Block and Euclidean Distance

A geometrical analysis is made of the dual simplex algorithm applied to a linear programming formulation of the one-center location problem in IR (2) using block distance. A geometric rule is given, and shown to be equivalent to the minimum ratio rule of the simplex algorithm, for updating the dual basis. The geometric analysis is applied to the Euclidean distance one-center problem and yields ...

متن کامل

A particle swarm optimization algorithm for the continuous absolute p-center location problem with Euclidean distance

The p-center location problem is concerned with determining the location of p centers in a plane/space to serve n demand points having fixed locations. The continuous absolute pcenter location problem attempts to locate facilities anywhere in a space/plane with Euclidean distance. The continuous Euclidean p-center location problem seeks to locate p facilities so that the maximum Euclidean dista...

متن کامل

Location problems in regions with and block norms

  We consider the two well knownminimax and minisum single facility location problems in the plane which has been divided into two regions, and by a straight line. The two regions are measured by various norms . We focus on three special cases in which the regions and are measured by and norms, and block norms, two distinct block norms. Based on the properties of block norms then we use linear ...

متن کامل

One-Pass Trajectory Simplification Using the Synchronous Euclidean Distance

Various mobile devices have been used to collect, store and transmit tremendous trajectory data, and it is known that raw trajectory data seriously wastes the storage, network band and computing resource. To attack this issue, one-pass line simplification (LS) algorithms have are been developed, by compressing data points in a trajectory to a set of continuous line segments. However, these algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Research of the National Institute of Standards and Technology

سال: 2006

ISSN: 1044-677X

DOI: 10.6028/jres.111.007