A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters
نویسندگان
چکیده
منابع مشابه
A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness
This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...
متن کاملA Parallel Genetic Algorithm for the Set Partitioning Problem
In this dissertation we report on our e orts to develop a parallel genetic algorithm and apply it to the solution of the set partitioning problem|a di cult combinatorial optimization problem used by many airlines as a mathematical model for ight crew scheduling. We developed a distributed steady-state genetic algorithm in conjunction with a specialized local search heuristic for solving the set...
متن کاملA Novel Algorithm to Find Maximum Power Point for Solar Systems under Partial Shading
In this paper, a new two-stage control algorithm to reach the maximum power point in photovoltaic (PV) systems under partially shaded conditions is presented. This algorithm tracks the maximum power point without any need to measure the open circuit voltage, short circuit current and making use of any extra switches. To achieve maximum power performance, the method firstly selects the relevant ...
متن کاملfrom linguistics to literature: a linguistic approach to the study of linguistic deviations in the turkish divan of shahriar
chapter i provides an overview of structural linguistics and touches upon the saussurean dichotomies with the final goal of exploring their relevance to the stylistic studies of literature. to provide evidence for the singificance of the study, chapter ii deals with the controversial issue of linguistics and literature, and presents opposing views which, at the same time, have been central to t...
15 صفحه اولinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2001
ISSN: 0743-7315
DOI: 10.1006/jpdc.2000.1706