Results 31 to 40 of about 35,538 (168)
Application of genetic algorithm to industrial scheduling and problems of parameters evaluation
Lietuvos Matematikos Rinkinys, 2021 Genetic algorithms are widely used in various mathematical and real world problems. They are approximate metaheuristic algorithms, commonly used for solving NP-hard problems in combinatorial optimisation.
Edgaras Šakurovas +1 more
doaj +1 more source
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions [PDF]
Quantum, 2020 A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions.
Nai-Hui Chia, Sean Hallgren, Fang Song
doaj +1 more source
Algorithms, 2023 In the field of logistics and transportation (L&T), this paper reviews the utilization of simheuristic algorithms to address NP-hard optimization problems under stochastic uncertainty. Then, the paper explores an extension of the simheuristics concept by
Angel A. Juan +5 more
doaj +1 more source
Most Tensor Problems Are NP-Hard [PDF]
Journal of the ACM, 2013 We prove that multilinear (tensor) analogues of many efficiently computable problems in numerical linear algebra are NP-hard. Our list includes: determining the feasibility of a system of bilinear equations, deciding whether a 3-tensor possesses a given eigenvalue, singular value, or spectral norm; approximating an eigenvalue, eigenvector, singular ...
Hillar, Christopher, Lim, Lek-Heng
openaire +2 more sources
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
Discrete Applied Mathematics, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bauer, D. +3 more
openaire +2 more sources
1-mean and 1-medoid 2-clustering problem with arbitrary cluster sizes: Complexity and approximation [PDF]
Yugoslav Journal of Operations Research, 2023 We consider the following 2-clustering problem. Given N points in Euclidean space, partition it into two subsets (clusters) so that the sum of squared distances between the elements of the clusters and their centers would be minimum.
Pyatkin Artem V.
doaj +1 more source
Rearrangement operations on unrooted phylogenetic networks
Theory and Applications of Graphs, 2019 Rearrangement operations transform a phylogenetic tree into another one and hence induce a metric on the space of phylogenetic trees. Popular operations for unrooted phylogenetic trees are NNI (nearest neighbour interchange), SPR (subtree prune and ...
Remie Janssen, Jonathan Klawitter
doaj +1 more source
Heuristics for NP-hard optimization problems - simpler is better!?
Logistics & Sustainable Transport, 2015 We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at
Žerovnik Janez
doaj +1 more source
, 2018 In this paper, we show that deciding rigid foldability of a given crease pattern using all creases is weakly NP-hard by a reduction from Partition, and that deciding rigid foldability with optional creases is strongly NP-hard by a reduction from 1-in-3 SAT.
Akitaya, Hugo +5 more
openaire +2 more sources
Scanning Phylogenetic Networks Is NP-hard [PDF]
, 2020 Phylogenetic networks are rooted directed acyclic graphs used to depict the evolution of a set of species in the presence of reticulate events. Reconstructing these networks from molecular data is challenging and current algorithms fail to scale up to genome-wide data.
Berry, Vincent +2 more
openaire +2 more sources