نتایج جستجو برای: obnoxious

تعداد نتایج: 194  

2008
Wendy Ju Larry Leifer

Introduction Imagine, for a second, a doorman who behaves as automatic doors do. He does not acknowledge you when you approach or pass by. He gives no hint which door can or will open—until you wander within six feet of the door, whereupon he flings the door wide open. If you arrived after hours, you might stand in front of the doors for awhile before you realize that the doors are locked, beca...

Journal: :Int. J. Comput. Geometry Appl. 1999
Boaz Ben-Moshe Matthew J. Katz Michael Segal

We present e cient algorithms for several instances of the following facility location problem. (Facilities and demand sites are represented as points in the plane.) Place k obnoxious facilities, with respect to n given demand sites and m given regions, where the goal is to maximize the minimal distance between a demand site and a facility, under the constraint that each of the regions must con...

Journal: :Scholars Journal of Arts, Humanities and Social Sciences 2020

2011
Utpal K. Bhattacharya

In this paper a Vertex Covering Obnoxious Facility Location model on a Plane has been designed with a combination of three interacting criteria as follows: 1) Minimize the overall importance of the various existing facility points; 2) Maximize the minimum distance from the facility to be located to the existing facility points; 3) Maximize the number of existing facility points covered. Area re...

2015
J. MANUEL COLMENAR PETER GREISTORFER RAFAEL MARTÍ ABRAHAM DUARTE J. M. Colmenar

The Obnoxious p-Median problem consists in selecting a subset of p facilities from a given set of possible locations, in such a way that the sum of the distances between each customer and its nearest facility is maximized. The problem is NP-hard and can be formulated as an integer linear program. It was introduced in the 1990s, and a branch and cut method coupled with a tabu search has been rec...

2000
Zhongping Qin Yin-Feng Xu Binhai Zhu

In this paper we study the following general MaxMinoptimization problem concerning undesirable (obnoxious) facility location: Given a set of n sites S inside a convex region P , construct m garbage deposit sites Vm such that the minimum distance between these sites Vm and the union of S and Vm, Vm∪S, is maximized. We present a general method using Voronoi diagrams to approximately solve two suc...

Journal: :Discrete Applied Mathematics 2003
Paola Cappanera Giorgio Gallo Francesco Maffioli

2007
Kobe Shoji

Sugar cane growers in Puerto Rico are faced with problems of weed control as any other farmer in the world. He is faced with increased cost of production of cane, through higher labor and material costs. When labor costs were low, much of the weed control was done by many men using machetes and other implements. As every farmer knows "weeds are plants out of place." Since beginning of farming, ...

Journal: :Advances in Difference Equations 2021

Abstract In this paper, the hyperchaos analysis, optimal control, and synchronization of a nonautonomous cardiac conduction system are investigated. We mainly analyze, synchronize associated hyperchaotic behaviors using several approaches. More specifically, related nonlinear mathematical model is firstly introduced in forms both integer- fractional-order differential equations. Then attractors...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید