NOMAD
发表于 2025-3-23 11:15:19
Analysis of ,-Structure Stability of Convex Integer Programming Problemslaxation set are obtained. Upper bounds on cardinalities of the .-intervals are constructed under small enough variations of this set. Here we develop further the results presented in [.,.]. A similar bound on cardinality of .-covering (which is a special case of .-interval) has been obtained in [.].
钢盔
发表于 2025-3-23 15:04:11
http://reply.papertrans.cn/71/7022/702101/702101_12.png
烦躁的女人
发表于 2025-3-23 21:17:13
http://reply.papertrans.cn/71/7022/702101/702101_13.png
Jargon
发表于 2025-3-24 02:13:32
http://reply.papertrans.cn/71/7022/702101/702101_14.png
Endoscope
发表于 2025-3-24 05:18:24
http://reply.papertrans.cn/71/7022/702101/702101_15.png
无力更进
发表于 2025-3-24 09:44:08
A Problem of Finding the Maximal Spanning Connected Subgraph with Given Vertex Degreesuse it is a generalization of the well-known traveling salesman problem. Approximation polynomial-time algorithms are constructed for deterministic and random instances. Performance ratios of these algorithms are presented.
Phonophobia
发表于 2025-3-24 11:38:32
http://reply.papertrans.cn/71/7022/702101/702101_17.png
frugal
发表于 2025-3-24 18:47:52
Special Solution Methods for Replacement ProblemsIn this paper some replacement problems are considered. These problems are modelled as Markov decision problems. They have a special structure which is used to construct efficient solutions methods.
蛰伏
发表于 2025-3-24 20:41:25
Operations Research Proceedingshttp://image.papertrans.cn/o/image/702101.jpg
Amplify
发表于 2025-3-24 23:39:49
https://doi.org/10.1007/978-3-642-56656-1Analysis; Operations Research; Optimierung; Scheduling; Simulation; Spieltheorie; Stochastische Optimierun