Results 1 to 10 of about 7,486,633 (332)
QuateXelero: an accelerated exact network motif detection algorithm. [PDF]
PLoS ONE, 2013 Finding motifs in biological, social, technological, and other types of networks has become a widespread method to gain more knowledge about these networks' structure and function.
Sahand Khakabimamaghani +4 more
doaj +4 more sources
An ETH-Tight Exact Algorithm for Euclidean TSP [PDF]
IEEE Annual Symposium on Foundations of Computer Science, 2018 We study exact algorithms for {\sc Euclidean TSP} in $\mathbb{R}^d$. In the early 1990s algorithms with $n^{O(\sqrt{n})}$ running time were presented for the planar case, and some years later an algorithm with $n^{O(n^{1-1/d})}$ running time was ...
Bodlaender, Hans L. +4 more
core +6 more sources
Superlinear advantage for exact quantum algorithms [PDF]
Proceedings of the forty-fifth annual ACM symposium on Theory of Computing, 2013 A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms.
Ambainis, Andris
core +4 more sources
An Exact Algorithm for Minimum Vertex Cover Problem
Mathematics, 2019 In this paper, we propose a branch-and-bound algorithm to solve exactly the minimum vertex cover (MVC) problem. Since a tight lower bound for MVC has a significant influence on the efficiency of a branch-and-bound algorithm, we define two novel lower ...
Luzhi Wang +3 more
doaj +3 more sources
An exact algorithm for the unrestricted block relocation problem
Computers and Operations Research, 2018 The purpose of this study is to propose an exact algorithm for the unrestricted block relocation problem with distinct priorities. In this problem, a storage area is considered where blocks of the same size are stacked vertically in tiers. Because we can
Shunji Tanaka
exaly +2 more sources
The Moving Firefighter Problem
Mathematics, 2022 The original formulation of the firefighter problem defines a discrete-time process where a fire starts at a designated subset of the vertices of a graph G.
Bruno R. Gutiérrez-De-La-Paz +5 more
doaj +1 more source
An empirical analysis of exact algorithms for solving non-preemptive flow shop scheduling problem [PDF]
International Journal of Research in Industrial Engineering, 2022 Sequencing and scheduling are the forms of decision-making approach that play a vital role in the automation and services industries. Efficient scheduling can help the industries to achieve the full potential of their supply chains.
Md. Kawsar Ahmed Asif +3 more
doaj +1 more source
Economic Order Quantity for Growing Items with Discrete Orders [PDF]
مجله مدل سازی در مهندسی, 2019 This paper presents an economic order quantity model (EOQ) for growing items. In this inventory system, a buyer orders those items such as livestock and poultry, after a period of time grow and reach their ideal weight.
Amirhossein Nobil, Ata Allah Taleizadeh
doaj +1 more source
Constructing an Evolutionary Tree and Path–Cycle Graph Evolution along It
Mathematics, 2023 The paper solves the problem of constructing an evolutionary tree and the evolution of structures along it. This problem has long been posed and extensively researched; it is formulated and discussed below.
Konstantin Gorbunov, Vassily Lyubetsky
doaj +1 more source
Mathematical Formulations for Asynchronous Parallel Disassembly Planning of End-of-Life Products
Mathematics, 2022 Disassembly is one of the most time-consuming and labor-intensive activities during the value recovery of end-of-life (EOL) products. The completion time (makespan) of disassembling EOL products is highly associated with the allocation of operators ...
Leilei Meng +5 more
doaj +1 more source