DEFER
发表于 2025-3-27 00:41:44
0302-9743 R 2021, held in Irkutsk, Russia, in July 2021. .The 29 full papers and 1 short paper presented in this volume were carefully reviewed and selected from 102 submissions. Additionally, 2 full invited papers are presented in the volume. The papers are grouped in the following topical sections: combina
affluent
发表于 2025-3-27 02:10:50
On Asymptotically Optimal Approach for the Problem of Finding Several Edge-Disjoint Spanning Trees o undirected graphs turned out to be impossible due to the issues associated with the summation of dependent random variables. In this work we give an .-time algorithm with conditions of asymptotic optimality for the case of undirected graphs.
龙虾
发表于 2025-3-27 06:51:25
On Some Variants of the Merging Variables Based (1+1)-Evolutionary Algorithm with Application to Maxer worst case estimation than the original (1+1)-EA. In the experimental part we conduct comparison of the proposed strategy with several known variants of (1+1)-EA and demonstrate its practical applicability for a number of hard instances of MaxSAT problem.
Exclaim
发表于 2025-3-27 11:11:43
http://reply.papertrans.cn/63/6265/626487/626487_34.png
娘娘腔
发表于 2025-3-27 17:36:46
Conference proceedings 2021issions. Additionally, 2 full invited papers are presented in the volume. The papers are grouped in the following topical sections: combinatorial optimization; mathematical programming; bilevel optimization; scheduling problems; game theory and optimal control; operational research and mathematical economics; data analysis..
进入
发表于 2025-3-27 19:55:34
Conference proceedings 2021ld in Irkutsk, Russia, in July 2021. .The 29 full papers and 1 short paper presented in this volume were carefully reviewed and selected from 102 submissions. Additionally, 2 full invited papers are presented in the volume. The papers are grouped in the following topical sections: combinatorial opt
preeclampsia
发表于 2025-3-28 00:49:20
A Column Generation Based Heuristic for a Temporal Bin Packing Problemo get lower and upper bounds. Preliminary computational experiments for real test instances indicate a small gap between the bounds. The average relative error is at most 0.88% for one week planning horizon and about 50000 items. The average running time is 21 s for a personal computer.
Trochlea
发表于 2025-3-28 05:15:32
http://reply.papertrans.cn/63/6265/626487/626487_38.png
geriatrician
发表于 2025-3-28 06:30:28
On the Computational Efficiency of Catalyst Accelerated Coordinate Descentension . in . times and, in practice, demonstrates a faster convergence in comparison with standard methods. As an example of applying the proposed approach, it was shown a variant of obtaining on its basis some efficient methods for optimizing Markov Decision Processes (MDP) in a minimax formulation with a Nesterov smoothed target function.
衣服
发表于 2025-3-28 14:23:52
http://reply.papertrans.cn/63/6265/626487/626487_40.png