SA 01 Geometric Optimization Sponsor : Optimization / Network and Combinatorial Optimization

نویسندگان

  • Joseph Mitchell
  • Victor M. Zavala
چکیده

Let P be a set of n points in d-dimensional Euclidean space. A (k,eps)-kernel is a subset of P that, for every direction, epsilon-approximates the directional width of P, when k “outliers’’ can be ignored in that direction. We prove that small (k,eps)-kernels exist and describe efficient algorithms for computing them. Such kernels are instrumental in solving shape-fitting problems with k outliers. This is joint work with Sariel Har-Peled and Hai Yu.

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

ثبت نام

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

منابع مشابه

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

Traffic Signal Prediction Using Elman Neural Network and Particle Swarm Optimization

Prediction of traffic is very crucial for its management. Because of human involvement in the generation of this phenomenon, traffic signal is normally accompanied by noise and high levels of non-stationarity. Therefore, traffic signal prediction as one of the important subjects of study has attracted researchers’ interests. In this study, a combinatorial approach is proposed for traffic signal...

متن کامل

Finding the Optimal Path to Restoration Loads of Power Distribution Network by Hybrid GA-BCO Algorithms Under Fault and Fuzzy Objective Functions with Load Variations

In this paper proposes a fuzzy multi-objective hybrid Genetic and Bee colony optimization algorithm(GA-BCO) to find the optimal restoration of loads of power distribution network under fault.Restoration of distribution systems is a complex combinatorial optimization problem that should beefficiently restored in reasonable time. To improve the efficiency of restoration and facilitate theactivity...

متن کامل

An optimization neural network model with time-dependent and lossy dynamics

The paper deals with continuously operating optimization neural netw orks with lossy dynamics.As the main feature of the neural model time-varying nature of neuron activation functions is introduced. The model presented is general in the sense that it covers the cases of neural net w orks for combinatorial optimization (Hop eld-like netw orks) and neural models for optimization problems with co...

متن کامل

A Systematic Method to Analyze Transport Networks: Considering Traffic Shifts

Current network modeling practices usually assess the network performance at specified time interval, i.e. every 5 or 10 years time horizon. Furthermore, they are usually based on partially predictable data, which are being generated through various stochastic procedures. In this research, a new quantitative based methodology which combines combinatorial optimization modeling and transportation...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006