gruelling
发表于 2025-3-26 23:43:21
https://doi.org/10.1007/978-94-009-1529-9for the master problem. Each column corresponds to one possible tree of actions for one ship giving its schedule loading/unloading quantities for all demand scenarios. Computational results are given showing that medium sized problems can be solved successfully.
Spangle
发表于 2025-3-27 03:13:48
Jorge Freire Sousa,Riccardo Rossirk we are undertaking using interval methods.In our work a verified solver that constructs upper and lower bounds on the dynamic variables of initial value problem (IVP) for ODEs is used in a dynamic global optimization method (sequential approach). Particular attention is paid to the reduction of t
耐寒
发表于 2025-3-27 07:35:07
http://reply.papertrans.cn/15/1499/149883/149883_33.png
钢笔记下惩罚
发表于 2025-3-27 11:39:18
Christian Liebchen,Rolf H. MöhringWe consider the intrinsic difficulty of global optimization in high dimensional Euclidean space. We adopt an asymptotic analysis, and give a lower bound on the number of function evaluations required to obtain a given error tolerance. This lower bound complements upper bounds provided by recently proposed algorithms.
凹室
发表于 2025-3-27 16:55:59
http://reply.papertrans.cn/15/1499/149883/149883_35.png
Torrid
发表于 2025-3-27 17:46:22
http://reply.papertrans.cn/15/1499/149883/149883_36.png
Mendicant
发表于 2025-3-27 23:00:57
Mixed-Fleet Ferry Routing and Scheduling, .. Such piecewise convex functions closely approximate nonconvex functions, that seems to us as a natural extension of the piecewise affine approximation from convex analysis. Maximizing .(⋅ ) over a convex domain have been investigated during the last decade by carrying tools based mostly on line
Landlocked
发表于 2025-3-28 05:09:03
http://reply.papertrans.cn/15/1499/149883/149883_38.png
browbeat
发表于 2025-3-28 06:38:32
http://reply.papertrans.cn/15/1499/149883/149883_39.png
IRATE
发表于 2025-3-28 14:02:48
http://reply.papertrans.cn/15/1499/149883/149883_40.png