Results 261 to 270 of about 161,341 (310)
Some of the next articles are maybe not open access.
Complexity analysis and algorithms for the Program Download Problem
Journal of Combinatorial Optimization, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chao Peng 0004 +3 more
openaire +1 more source
Complexity Analysis and Algorithm Design of Pooling Problem
Journal of the Operations Research Society of China, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Hong Dai, Rui Diao, Kai Fu
openaire +1 more source
Algorithms and complexity analysis for some flow problems
Algorithmica, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edith Cohen, Nimrod Megiddo
openaire +3 more sources
On the algorithmic complexity of a problem in cluster analysis
Journal of Applied and Industrial Mathematics, 2011We prove that the MSSC problem (the problem of clustering the set of the vectors in the Euclidean space which minimizes the sum of squares) is NP-complete in the case when the dimension of the space is an input parameter of the problem, while the number of clusters is not an input parameter.
A. V. Dolgushev, A. V. Kel’manov
openaire +1 more source
Journal of Scheduling, 2021
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kameng Nip, Zhenbo Wang
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kameng Nip, Zhenbo Wang
openaire +1 more source
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
Journal of Scheduling, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bita Tadayon, J. Cole Smith
openaire +1 more source
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers & Operations Research, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Larusic, Abraham P. Punnen
openaire +3 more sources
A Self-Adaptive Complex Root Tracing Algorithm for the Analysis of Propagation and Radiation Problem
IEEE Transactions on Antennas and Propagation, 2021An improved complex root tracing algorithm for radiation and propagation issues is proposed. The approach is based on a self-adaptive discretization of Cauchy’s argument principle for a $\mathbb {C} \times \mathbb {R}$ space and requires a reduced number of function calls in comparison to other procedures presented in the literature.
Sebastian Dziedziewicz +2 more
openaire +1 more source
The Dynamic Portfolio Selection Problem: Complexity, Algorithms and Empirical Analysis
2020In the real world, problems usually involve a characteristic that is not typically considered when experimenting algorithmically; this characteristic is the change concerning time. The parameters included in many issues are not static, but dynamic, they are altered over time.
Daniel A. Martínez-Vega +4 more
openaire +1 more source
2014 IEEE Symposium on Differential Evolution (SDE), 2014
This paper analyses the attributes of population dynamics of Differential Evolution algorithm using Complex Network Analysis tools. The population is visualised as an evolving complex network, which exhibits non-trivial features. Complex network attributes such as adjacency graph gives interconnectivity, centralities give the overview of convergence ...
Donald Davendra +4 more
openaire +3 more sources
This paper analyses the attributes of population dynamics of Differential Evolution algorithm using Complex Network Analysis tools. The population is visualised as an evolving complex network, which exhibits non-trivial features. Complex network attributes such as adjacency graph gives interconnectivity, centralities give the overview of convergence ...
Donald Davendra +4 more
openaire +3 more sources