An Algorithm for Exact Division
نویسندگان
چکیده
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملan exact algorithm for the mode identity project scheduling problem
in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملAn Exact Algorithm for Minimum Distortion Embedding
Let G be an unweighted graph on n vertices. We show that an embedding of the shortest path metric of G into the line with minimum distortion can be found in time 5. This is the first algorithm breaking the trivial n!-barrier.
متن کاملAn exact algorithm for Aircraft Landing Problem
This paper addresses the problem of scheduling aircraft landings at an airport. Given a set of planes and runways, the objective is to minimize the total (weighted) deviation from the target landing time for each plane. There are costs associated with landing either earlier or later than a target landing time for each plane. Each plane has to land on one of the runways within its predetermined ...
متن کاملAn Exact Algorithm for F-Measure Maximization
The F-measure, originally introduced in information retrieval, is nowadays routinely used as a performance metric for problems such as binary classification, multi-label classification, and structured output prediction. Optimizing this measure remains a statistically and computationally challenging problem, since no closed-form maximizer exists. Current algorithms are approximate and typically ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1993
ISSN: 0747-7171
DOI: 10.1006/jsco.1993.1012