We are analyzing https://link.springer.com/article/10.1007/s10479-005-2044-2.

Title:
Demand Point Aggregation for Planar Covering Location Models | Annals of Operations Research
Description:
The covering location problem seeks the minimum number of facilities such that each demand point is within some given radius of its nearest facility. Such a model finds application mostly in locating emergency types of facilities. Since the problem is NP-hard in the plane, a common practice is to aggregate the demand points in order to reduce the computational burden. Aggregation makes the size of the problem more manageable but also introduces error. Identifying and controlling the magnitude of the error is the subject of this study. We suggest several aggregation methods with a priori error bounds, and conduct experiments to compare their performance. We find that the manner by which infeasibility is measured greatly affects the best choice of an aggregation method.
Website Age:
28 years and 1 months (reg. 1997-05-29).

Matching Content Categories {📚}

Education
Mobile Technology & AI
Social Networks

Content Management System {📝}

What CMS is link.springer.com built with?

Custom-built

No common CMS systems were detected on Link.springer.com, and no known web development framework was identified.

Traffic Estimate {📈}

What is the average monthly size of link.springer.com audience?

🌠 Phenomenal Traffic: 5M - 10M visitors per month

Based on our best estimate, this website will receive around 5,000,019 visitors per month in the current month.
However, some sources were not loaded, we suggest to reload the page to get complete results.

check SE Ranking
check Ahrefs
check Similarweb
check Ubersuggest
check Semrush

How Does Link.springer.com Make Money? {💸}

We can't tell how the site generates income.

Earning money isn't the goal of every website; some are designed to offer support or promote social causes. People have different reasons for creating websites. This might be one such reason. Link.springer.com could be secretly minting cash, but we can't detect the process.

Keywords {🔍}

google, scholar, article, location, aggregation, research, problems, francis, analysis, operations, problem, models, demand, covering, facility, journal, point, methods, pmedian, lowe, privacy, cookies, content, data, annals, error, discrete, network, applications, springer, rayco, publish, search, access, chapter, york, errors, geographical, pcenter, science, siam, european, information, log, find, emirfarinas, emergency, related, discover, theory,

Topics {✒️}

month download article/chapter unweighted p-center problems maximum covering models p-median location problems constrained location models multi-facility location problems worst-case aggregation analysis related subjects demand point aggregation p-median problem p-center problem privacy choices/manage cookies m-center problem discrete location theory m-center problems geometric location problems demand data aggregation full article pdf model finds application location-allocation models demand point operations research aims network location problems locating emergency types network flow problems �row-column aggregation scope submit manuscript measured greatly affects �aggregation error bounds �siting emergency services conditions privacy policy �asymptotically optimal aggregation priori error bounds article emir-farinas european economic area accepting optional cookies covering problems main content log discrete location aggregation problem penalty function approach location models check access instant access journal finder publish facility location operations research 18 operations research operations research 40 demand points

Schema {🗺️}

WebPage:
      mainEntity:
         headline:Demand Point Aggregation for Planar Covering Location Models
         description:The covering location problem seeks the minimum number of facilities such that each demand point is within some given radius of its nearest facility. Such a model finds application mostly in locating emergency types of facilities. Since the problem is NP-hard in the plane, a common practice is to aggregate the demand points in order to reduce the computational burden. Aggregation makes the size of the problem more manageable but also introduces error. Identifying and controlling the magnitude of the error is the subject of this study. We suggest several aggregation methods with a priori error bounds, and conduct experiments to compare their performance. We find that the manner by which infeasibility is measured greatly affects the best choice of an aggregation method.
         datePublished:
         dateModified:
         pageStart:175
         pageEnd:192
         sameAs:https://doi.org/10.1007/s10479-005-2044-2
         keywords:
            location models
            demand point aggregation
            covering problem
            Operations Research/Decision Theory
            Combinatorics
            Theory of Computation
         image:
         isPartOf:
            name:Annals of Operations Research
            issn:
               1572-9338
               0254-5330
            volumeNumber:136
            type:
               Periodical
               PublicationVolume
         publisher:
            name:Kluwer Academic Publishers
            logo:
               url:https://www.springernature.com/app-sn/public/images/logo-springernature.png
               type:ImageObject
            type:Organization
         author:
               name:H. Emir-Farinas
               affiliation:
                     name:University of Florida
                     address:
                        name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
                        type:PostalAddress
                     type:Organization
               type:Person
               name:R. L. Francis
               affiliation:
                     name:University of Florida
                     address:
                        name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
                        type:PostalAddress
                     type:Organization
               email:[email protected]
               type:Person
         isAccessibleForFree:
         hasPart:
            isAccessibleForFree:
            cssSelector:.main-content
            type:WebPageElement
         type:ScholarlyArticle
      context:https://schema.org
ScholarlyArticle:
      headline:Demand Point Aggregation for Planar Covering Location Models
      description:The covering location problem seeks the minimum number of facilities such that each demand point is within some given radius of its nearest facility. Such a model finds application mostly in locating emergency types of facilities. Since the problem is NP-hard in the plane, a common practice is to aggregate the demand points in order to reduce the computational burden. Aggregation makes the size of the problem more manageable but also introduces error. Identifying and controlling the magnitude of the error is the subject of this study. We suggest several aggregation methods with a priori error bounds, and conduct experiments to compare their performance. We find that the manner by which infeasibility is measured greatly affects the best choice of an aggregation method.
      datePublished:
      dateModified:
      pageStart:175
      pageEnd:192
      sameAs:https://doi.org/10.1007/s10479-005-2044-2
      keywords:
         location models
         demand point aggregation
         covering problem
         Operations Research/Decision Theory
         Combinatorics
         Theory of Computation
      image:
      isPartOf:
         name:Annals of Operations Research
         issn:
            1572-9338
            0254-5330
         volumeNumber:136
         type:
            Periodical
            PublicationVolume
      publisher:
         name:Kluwer Academic Publishers
         logo:
            url:https://www.springernature.com/app-sn/public/images/logo-springernature.png
            type:ImageObject
         type:Organization
      author:
            name:H. Emir-Farinas
            affiliation:
                  name:University of Florida
                  address:
                     name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
                     type:PostalAddress
                  type:Organization
            type:Person
            name:R. L. Francis
            affiliation:
                  name:University of Florida
                  address:
                     name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
                     type:PostalAddress
                  type:Organization
            email:[email protected]
            type:Person
      isAccessibleForFree:
      hasPart:
         isAccessibleForFree:
         cssSelector:.main-content
         type:WebPageElement
["Periodical","PublicationVolume"]:
      name:Annals of Operations Research
      issn:
         1572-9338
         0254-5330
      volumeNumber:136
Organization:
      name:Kluwer Academic Publishers
      logo:
         url:https://www.springernature.com/app-sn/public/images/logo-springernature.png
         type:ImageObject
      name:University of Florida
      address:
         name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
         type:PostalAddress
      name:University of Florida
      address:
         name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
         type:PostalAddress
ImageObject:
      url:https://www.springernature.com/app-sn/public/images/logo-springernature.png
Person:
      name:H. Emir-Farinas
      affiliation:
            name:University of Florida
            address:
               name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
               type:PostalAddress
            type:Organization
      name:R. L. Francis
      affiliation:
            name:University of Florida
            address:
               name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
               type:PostalAddress
            type:Organization
      email:[email protected]
PostalAddress:
      name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
      name:Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
WebPageElement:
      isAccessibleForFree:
      cssSelector:.main-content

External Links {🔗}(75)

Analytics and Tracking {📊}

Google Tag Manager

Libraries {📚}

Clipboard.js
Prism.js

CDN Services {📦}

Crossref

3.93s.

LINK . SPRINGER . COM {}