Results 171 to 180 of about 151,418 (244)
Algorithms and Complexity Analysis for Robust Single-Machine Scheduling Problems
Journal of Scheduling, 2015 In this paper, we study a robust single-machine scheduling problem under four alternative optimization criteria: minimizing total completion time, minimizing total weighted completion time, minimizing maximum lateness, and minimizing the number of late jobs. We assume that job processing times are subject to uncertainty. Accordingly, we construct three
Bita Tadayon, J. Cole Smith
semanticscholar +4 more sources
On the algorithmic complexity of a problem in cluster analysis
Journal of Applied and Industrial Mathematics, 2011 We 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
openalex +3 more sources
The Dynamic Portfolio Selection Problem: Complexity, Algorithms and Empirical Analysis
, 2020 In 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
openalex +3 more sources
Students misconceptions in analysis of algorithmic and computational complexity of problems
Proceedings of the 18th ACM conference on Innovation and technology in computer science education, 2013 Course "Computability and Complexity" allows students to get familiar with limits of computation and degrees of algorithmic (decidable, enumerable, undecidable) and computational (P, NP, NP-complete) complexity of problems. Students learn to use reducibility techniques for analysis of language complexity.
Mark Trakhtenbrot
openalex +3 more sources
Algorithms and complexity analysis for some flow problems
Algorithmica, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edith Cohen, Nimrod Megiddo
openalex +5 more sources
Computational Complexity Analysis and Algorithm Design for Combinatorial Optimization Problems
2012 Third International Conference on Networking and Computing, 2012 The paper shows summary of the author's research subjects from 1973 through 2012. Additional explanation on these subjects and related references are omitted because of space limitation. They will be given at presentation.
Toshimasa Watanabe
openalex +3 more sources
Complexity analysis and algorithms for the Program Download Problem
Journal of Combinatorial Optimization, 2014 In this paper, we consider the Program Download Problem (PDP) which is to download a set of desired programs from multiple channels. When the problem is to decide whether the download can be done by a given deadline $$d$$ d and each program appears in each of the $$n$$ n channels at most once, denoted as $$\textit{PDP}(n,1,d)$$ PDP ( n , 1 , d ) , we ...
Chao Peng +3 more
openalex +3 more sources
Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems
, 2017 Evolutionary algorithms are general problem solvers that have been successfully used in solving combinatorial optimization problems. However, due to the great amount of randomness in these algorithms, theoretical understanding of them is quite challenging.
Mojgan Pourhassan
openalex +4 more sources
Applied Mathematics and Computation, 2010 In this paper we deal with the study of the polynomial complexity and numerical implementation for a short-step primal-dual interior point algorithm for monotone linear complementarity problems LCP. The analysis is based on a new class of search directions used by the author for convex quadratic programming (CQP) [M.
Mohamed Achache
openalex +3 more sources