Accelerating backtrack search with a best-first-search strategy
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Zoltán Ádám Mann, Tamás Szép (2014)
International Journal of Applied Mathematics and Computer Science
Similarity:
Maric, Miroslav (2013)
Serdica Journal of Computing
Similarity:
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...
Jacek Błażewicz, Paolo Dell'Olmo, Maciej Drozdowski (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
In this work scheduling multiprocessor tasks on two parallel identical processors is considered. Multiprocessor tasks can be executed by more than one processor at the same moment of time. We analyze scheduling unit execution time and preemptable tasks to minimize schedule length and maximum lateness. Cases with ready times, due-dates and precedence constraints are discussed.
Hadda Cherroun, Alain Darte, Paul Feautrier (2007)
RAIRO - Operations Research
Similarity:
The recourse to operation research solutions has strongly increased the performances of scheduling task in the High-Level Synthesis (called hardware compilation). Scheduling a whole program is not possible as too many constraints and objectives interact. We decompose high-level scheduling in three steps. Step 1: Coarse-grain scheduling tries to exploit parallelism and locality of the whole program (in particular in loops, possibly imperfectly nested) with a rough view of the target...
Martinovic, Goran, Aleksi, Ivan, Baumgartner, Alfonzo (2008)
Mathematical Problems in Engineering
Similarity:
Edmund Burke, Yuri Bykov, James Newall, Sanja Petrović (2003)
The Yugoslav Journal of Operations Research
Similarity:
Lyons, Kelly A., Meijer, Henk, Rappaport, David (1998)
Journal of Graph Algorithms and Applications
Similarity:
Charalampos Papamanthou, Konstantinos Paparrizos, Nikolaos Samaras (2005)
The Yugoslav Journal of Operations Research
Similarity:
Barth, Wilhelm, Mutzel, Petra, Jünger, Michael (2004)
Journal of Graph Algorithms and Applications
Similarity:
Aleksandar B. Samardžić, Dušan Starčević, Milan Tuba (2006)
The Yugoslav Journal of Operations Research
Similarity:
Peng Wuliang, Huang Min, Hao Yongping (2014)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Many real-world scheduling problems can be modeled as Multi-mode Resource Constrained Project Scheduling Problems (MRCPSP). However, the MRCPSP is a strong NP-hard problem and very difficult to be solved. The purpose of this research is to investigate a more efficient alternative based on ant algorithm to solve MRCPSP. To enhance the generality along with efficiency of the algorithm, the rule pool is designed to manage numerous priority rules for MRCPSP. Each ant is provided with an...
Ghoseiri, Keivan, Morshedsolouk, Fahimeh (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Ivan Stanimirović, Marko Petković, Predrag Stanimirović, Miroslav Ćirić (2009)
The Yugoslav Journal of Operations Research
Similarity:
Renaud Sirdey, Hervé L. M. Kerivin (2007)
RAIRO - Operations Research
Similarity:
This paper is devoted to the exact resolution of a strongly -hard resource-constrained scheduling problem, the , which arises in relation to the operability of certain high-availability real-time distributed systems. Based on the study of the polytope defined as the convex hull of the incidence vectors of the admissible process move programs, we present a branch-and-cut algorithm along with extensive computational results demonstrating its practical relevance, in terms of both exact...
Chen, Wei-Mei, Hwang, Hsien-Kuei, Tsai, Tsung-Hsi (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity: