computerized design of under-ground mining method d一x!0 eo一kuong fongfo shejl deJ一suanjl fongfa地下采矿方法设计的计算机方法(c omPuter-ized design of underground mining method)用计算机和优化技术完成地下采矿方法设计的一种手段。由于地下采矿方
The GRASP metaheuristic is a successful method to solve CO problems, especially vehicle routing problems [56] since it benefits from good initial solutions that usually lead to promising final solutions due to randomization. In addition to the local search procedures, it ensures the intensification an...
Pan, "Approximation for maximizing monotone non-decreasing set functions with a greedy method," preprint.Wang Z, Moran B, Wang X, Pan Q (2016) Approximation for maximizing monotone non-decreasing set functions with a greedy method. J Comb Optim 31(1):29-43. http://dx.doi.org/10.1007/...
4. General Structure of Greedy Algorithm 5. Pair Work 1. A Short-Sighted Algorithm Greedy algorithm is another method of finding out the optimal solution, or the nearly optimal one of a task. Unlike DP, however, the Greedy algorithm may not always be able to find out the GLOBAL optimum,...
One method to reduce vibrations is introducing jerk constraints along each axis to the original problem, which can generate a continuous acceleration profile. When jerk constraints are added, the analysis must be performed in the u–u˙–u¨ phase space instead of the u–u˙ phase plane. The...
If a greedy algorithm can be proven to yield the global optimum for a given problem class, it typically becomes the method of choice because it is faster than other optimization methods like dynamic programming. Examples of such greedy algorithms are Kruskal's algorithm and Prim's algorithm for...
In this work we take advantage of an efficient greedy sparsification method in order to obtain an approximate, provably convergent, online SVR algorithm that we call SOG-SVR (sparse online greedy SVR). The remainder of the paper is organized as follows: In Section 2 we briefly overview support...
We show that the greedy algorithm provided in this paper works for interval greedoids with positive weights under some conditions, and also characterize an exchangeable system to be an interval greedoid with the assistance of the greedy algorithm.
(2013), a scatter search method by Naderi & Ruiz (2014), a discrete electromagnetism algorithm by Liu & Gao (2010). Additionally, Shao et al., (2020) proposed a fruit fly algorithm for the problem under the blocking constraint and Zhao et al., (2020) an ensemble discrete differential ...
We study a logistic model-based active learning procedure for binary classification problems, in which we adopt a batch subject selection strategy with a modified sequential experimental design method. Moreover, accompanying the proposed subject selection scheme, we simultaneously conduct a greedy variable...