نتایج جستجو برای: exact algorithm
تعداد نتایج: 851573 فیلتر نتایج به سال:
From 13.03. to 16.03.2007, the Dagstuhl Seminar 07112 Cutting, Packing, Layout and Space Allocation was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of semi...
A new fast and exact algorithm for determining the -NN classification of multichannel image data, and a new distance transform algorithm are described. Complexity analysis and empirical studies with magnetic resonance images (MRI) demonstrate the effectiveness of the new classification algorithm.
This article presents the preliminary results on a new branch-and-bound algorithm proposed for the single machine total tardiness problem with arbitrary release dates. The algorithm relies on dominance properties from the literature as well as a new branching condition. A new lower bounding technique for the problem is also introduced. The performance of the algorithm is compared to the perform...
in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...
The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0-1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate core for the MMKP and utilize it to solve the problem exactly. Computational results show that the algorit...
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.
Realization of efficient Universal Logic Modules (ULMs) is a challenging topic in circuit design. The goal is to find a representation that allows to realize as many Boolean functions as possible by permutation of inputs or phase assignment. In this paper an exact algorithm for finding a minimal circuit for a ULM is presented. The approach is parametrisized in several ways, e.g. the user can de...
In this paper we study a variant of the Capacitated Team Orienteering Problem (CTOP), that is the problem where a fleet of vehicles, each with a constraint on the time available, is given to serve profitable customers with the objective of maximizing the collected profit. We study the variant where customers may be only partially served (incomplete service) and, if beneficial, also by more than...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید