Polzin T, Daneshmand SV (2001) Improved algorithms for the Steiner problem in networks. Discret Appl Math 112(1-3): 263–300Polzin, T., Daneshmand, S.V.: Improved algorithms for the steiner problem in networks.
Using similar techniques, we also give improved algorithms on both the two-sided and the one-sided discrete Fréchet distance with shortcuts problem for two point sets in the plane. For the two-sided problem (resp., one-sided problem), we improve the previous work (Avraham et al. in ACM...
In this communication we improve the complexity bound in Costa et al. (Oper. Res. Lett. 31:21–27, 2003 ) and show that in the case of the integer multicut and multiflow problems in a rooted tree the greedy algorithm of Kolen can be implemented in subquadratic O ( K + n +min( K...
the main contribution of this article is the development of a novel algorithm that is closely related to a family of existing exact penalty (EXP) algorithms, which have been analyzed both in the context of general constrained optimization [20], [21] and in the context of integer optimization ...
(n)) complexity on average, which is provably optimal. But in the worst case, Quicksort hasO(n2) complexity, which is not acceptable. There are other sorting algorithms such as Heapsort that do not have this problem, but they exhibit more difficult data access patterns or require more...
Through the above analysis, we can find that in order to solve the problems of slow convergence speed and easy to fall into local optimization in metaheuristic algorithms, scholars mainly improve population initialization methods by introducing chaotic mapping and integrating Levy flight strategy. t-dis...
14, it can be seen that the calculation results of different algorithms on different instances are divergent, while the calculation results on the same instance are similar, which indicates the complexity of instance calculation and the importance of algorithm design. The random HPS algorithm shows ...
for gene selection” section provides a detailed explanation for the proposed RBNRO-DE algorithm, which is the improved version of NRO and its parameters to handle GS; “Experimental results and discussion” section presents the experimental results and comparisons with some competitive algorithms; and...
Therefore, both simulation and optimisation algorithms are crucial for the feasible/infeasible path algorithms. For the inner-level simulation, the pseudo-transient continuation (PTC) modelling approach has been introduced to resolve the convergence issue of the equation-oriented simulation (Pattison and ...
“Improvement of update method for good group in student learning phase” Section in IGTOA, the improved algorithm for removing the common group improvement strategy of “Improvement of update method for average student group” Section in IGTOA and improved algorithms for the population reconstruction...