標(biāo)題: Titlebook: Optimization and Applications; 9th International Co Yury Evtushenko,Milojica Ja?imovi?,Mikhail Posypki Conference proceedings 2019 Springer [打印本頁] 作者: HAG 時(shí)間: 2025-3-21 18:14
書目名稱Optimization and Applications影響因子(影響力)
書目名稱Optimization and Applications影響因子(影響力)學(xué)科排名
書目名稱Optimization and Applications網(wǎng)絡(luò)公開度
書目名稱Optimization and Applications網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Optimization and Applications被引頻次
書目名稱Optimization and Applications被引頻次學(xué)科排名
書目名稱Optimization and Applications年度引用
書目名稱Optimization and Applications年度引用學(xué)科排名
書目名稱Optimization and Applications讀者反饋
書目名稱Optimization and Applications讀者反饋學(xué)科排名
作者: exhibit 時(shí)間: 2025-3-21 22:10
Conference proceedings 2019ntenegro, in October 2018.The 35 revised full papers and the one short paper presented were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections on?mathematical programming;?combinatorial and discrete optimization;?optimal control;?optimization in economy, finance and social sciences;?applications..作者: HUSH 時(shí)間: 2025-3-22 03:35
Communications in Computer and Information Sciencehttp://image.papertrans.cn/o/image/703189.jpg作者: 高興去去 時(shí)間: 2025-3-22 05:20
https://doi.org/10.1007/978-3-030-10934-9artificial intelligence; augmented reality; computer networks; display devices; Human-Computer Interacti作者: Amnesty 時(shí)間: 2025-3-22 09:50
978-3-030-10933-2Springer Nature Switzerland AG 2019作者: progestin 時(shí)間: 2025-3-22 16:37 作者: fiction 時(shí)間: 2025-3-22 18:53
Time Complexity of the Ageev’s Algorithm to Solve the Uniform Hard Capacities Facility Location ProbWe show that the facility location problem with uniform hard capacities can be solved by the Ageev’s algorithm in . time, where . is the number of facilities and . is the number of clients. This improves the results . of Ageev in 2004 and . of Ageev, Gimadi, and Kurochkin in?2009.作者: 主動(dòng)脈 時(shí)間: 2025-3-22 23:04 作者: Paraplegia 時(shí)間: 2025-3-23 05:00
New Perspective on Slack Variables Applications to Singular Optimization Problemsations is singular. It happens when the strict complementarity condition (SCC), a constrained qualification (CQ), and a second-order sufficient condition (SOSC) for optimality is not necessarily satisfied at a solution. Our approach is based on the construction of .-regularity and on reformulating t作者: oracle 時(shí)間: 2025-3-23 05:52 作者: tolerance 時(shí)間: 2025-3-23 11:18 作者: Senescent 時(shí)間: 2025-3-23 14:47 作者: Employee 時(shí)間: 2025-3-23 21:24
Mirror Descent and Constrained Online Optimization Problemsnon-smooth functionals are given on a closed set of .-dimensional vector space. The problem is to minimize the arithmetic mean of functionals with a convex Lipschitz-continuous non-smooth constraint. In addition, it is allowed to calculate the (sub)gradient of each functional only once. Using some r作者: Orchiectomy 時(shí)間: 2025-3-24 00:39 作者: Pander 時(shí)間: 2025-3-24 02:31 作者: 同位素 時(shí)間: 2025-3-24 10:34 作者: packet 時(shí)間: 2025-3-24 14:36 作者: SHRIK 時(shí)間: 2025-3-24 14:50
Improved Polynomial Time Approximation Scheme for Capacitated Vehicle Routing Problem with Time Windn operations research. In this paper, following the famous framework by M.?Haimovich and A.?Rinnooy Kan and technique by T.?Asano et al., we propose a novel approximation scheme for the planar Euclidean CVRPTW. For any fixed ., the proposed scheme finds a .-approximate solution of CVRPTW in time .wh作者: abduction 時(shí)間: 2025-3-24 21:44
Piecewise Linear Bounding Functions for Univariate Global Optimizationn global optimization where such bounds are used by deterministic methods to reduce the search area. It should be noted that bounding functions are expected to be relatively easy to construct and manipulate with. We propose to use piecewise linear estimators for bounding univariate functions. The ru作者: 盲信者 時(shí)間: 2025-3-25 00:37 作者: 排斥 時(shí)間: 2025-3-25 05:16
Minimization of the Weighted Total Sparsity of Cosmonaut Training Coursesw goal function. Training of each cosmonaut is divided into special courses. To avoid too sparse courses, we introduce a special objective function—the weighted total sparsity of training courses. This non-regular objective function requires the development of new methods that differ from methods fo作者: 宏偉 時(shí)間: 2025-3-25 08:37
Genetic Local Search for Conflict-Free Minimum-Latency Aggregation Scheduling in Wireless Sensor Netsferred to the sink. During one time slot (time is discrete) each sensor can either send or receive one message or be idle. Moreover, only one message should be sent by each sensor during the aggregation session, and the conflicts caused by interference of radio waves must be excluded. It is require作者: Genome 時(shí)間: 2025-3-25 13:31 作者: 銼屑 時(shí)間: 2025-3-25 17:34
Conference proceedings 2019ntenegro, in October 2018.The 35 revised full papers and the one short paper presented were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections on?mathematical programming;?combinatorial and discrete optimization;?optimal control;?optimization in econom作者: Gesture 時(shí)間: 2025-3-25 22:37 作者: Processes 時(shí)間: 2025-3-26 00:07 作者: 不幸的人 時(shí)間: 2025-3-26 08:18
Genetic Local Search for Conflict-Free Minimum-Latency Aggregation Scheduling in Wireless Sensor Netgorithm that uses a genetic algorithm and contains the local search procedures and the randomized mutation procedure. The extensive simulation demonstrates a superiority of our algorithm over the best of the previous approaches.作者: Calculus 時(shí)間: 2025-3-26 08:36 作者: Ostrich 時(shí)間: 2025-3-26 12:47 作者: 徹底檢查 時(shí)間: 2025-3-26 17:46 作者: Defense 時(shí)間: 2025-3-26 23:14
Subgradient Method with Polyak’s Step in Transformed Spacea given accuracy by the value of the function was performed. Examples of ravine convex (smooth and non-smooth) functions are given, for which convergence of method A is slow. It is shown that with a suitable choice of the space transformation matrix method B can be significantly accelerated in comparison with method A for ravine convex functions.作者: inscribe 時(shí)間: 2025-3-27 04:10
Mirror Descent and Constrained Online Optimization Problemsecently proposed adaptive methods of Mirror Descent the method is suggested to solve the mentioned constrained online optimization problem with an optimal estimate of accuracy. For the corresponding non-Euclidean prox-structure, the case of a set of .-dimensional vectors lying on the standard .-dimensional simplex is considered.作者: Tonometry 時(shí)間: 2025-3-27 07:49
Primal-Dual Newton’s Method with Steepest Descent for Linear Programming minimization of the dual gap. The safety factor is not introduced, and trajectories are allowed to move along the boundaries of the feasible sets. The convergence of the method at a finite number of iterations is proved.作者: 成績上升 時(shí)間: 2025-3-27 09:39
Improved Polynomial Time Approximation Scheme for Capacitated Vehicle Routing Problem with Time Windere . is the given vehicle capacity bound, . is the number of time windows for servicing the customers, and . is the time needed to find a .-approximate solution for an auxiliary instance of the metric TSP.作者: 憲法沒有 時(shí)間: 2025-3-27 16:47 作者: 高興去去 時(shí)間: 2025-3-27 20:57 作者: DEFER 時(shí)間: 2025-3-27 23:43
Minimization of the Weighted Total Sparsity of Cosmonaut Training Coursesr solving the thoroughly studied RCPSP with the makespan criterion. New heuristic algorithms for solving this problem are proposed. Their efficiency is verified on real-life data. In a reasonable time, the algorithms let us find a solution that is better than the solution found with the help of the solver CPLEX CP Optimizer.作者: synovial-joint 時(shí)間: 2025-3-28 04:10 作者: Mirage 時(shí)間: 2025-3-28 08:52
Yury Evtushenko,Milojica Ja?imovi?,Mikhail Posypki作者: 倔強(qiáng)一點(diǎn) 時(shí)間: 2025-3-28 11:07
Grigorii E. Ivanov,Mariana S. Lopushanski,Maxim O. Golubev作者: 誰在削木頭 時(shí)間: 2025-3-28 16:05 作者: rheumatology 時(shí)間: 2025-3-28 22:11
Alexander Kel’manov,Sergey Khamidullin,Vladimir Khandeev,Artem Pyatkin作者: chlorosis 時(shí)間: 2025-3-29 00:33
Alexander Kel’manov,Vladimir Khandeev,Artem Pyatkin作者: 圓錐體 時(shí)間: 2025-3-29 06:22 作者: Muscularis 時(shí)間: 2025-3-29 07:39 作者: Cubicle 時(shí)間: 2025-3-29 13:08
8樓作者: Visual-Field 時(shí)間: 2025-3-29 19:16
9樓作者: 發(fā)現(xiàn) 時(shí)間: 2025-3-29 21:05
9樓作者: gratify 時(shí)間: 2025-3-30 02:51
9樓作者: EVICT 時(shí)間: 2025-3-30 06:00
9樓作者: caldron 時(shí)間: 2025-3-30 10:57
10樓作者: chronology 時(shí)間: 2025-3-30 15:47
10樓作者: muffler 時(shí)間: 2025-3-30 16:46
10樓作者: 機(jī)警 時(shí)間: 2025-3-30 21:40
10樓
