预示
发表于 2025-3-27 00:23:27
Clutter percolation and random graphs,The “clutter percolation theorem” is presented and from it are deduced various results on paths in random graphs and digraphs.
雕镂
发表于 2025-3-27 02:58:11
http://reply.papertrans.cn/23/2300/229962/229962_32.png
隐语
发表于 2025-3-27 08:54:12
Heuristic improvement methods: How should starting solutions be chosen?,A theoretical framework for improvement heuristic methods, as applied to discrete optimization problems, is put forward. The problem of choosing a suitable set of start points, from which to perform hill-climbs, is identified and some possible solutions considered. Numerical results are presented.
Collected
发表于 2025-3-27 10:12:31
http://reply.papertrans.cn/23/2300/229962/229962_34.png
incredulity
发表于 2025-3-27 14:45:45
A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem,oits both the transformation and the greedily obtained approximate solution described in a previous paper by the author. This branch and bound algorithm has the property that at each bound an associated solution is obtained simultaneously, thereby rendering any premature termination of the algorithm less wasteful.
FLOAT
发表于 2025-3-27 18:49:55
http://reply.papertrans.cn/23/2300/229962/229962_36.png
过分自信
发表于 2025-3-28 00:34:53
Optimization problems arising from the incorporation of split values in search trees,. Results are given to compare the efficiency of such trees with that of median split trees and some open problems arising are discussed. The concept of a generalised tree is introduced together with a description of how the solution of the difficult problems arising would have a considerable practical impact in the design of data bases.
重画只能放弃
发表于 2025-3-28 03:58:55
http://reply.papertrans.cn/23/2300/229962/229962_38.png
Isometric
发表于 2025-3-28 08:51:38
https://doi.org/10.1007/978-3-031-26204-3imum flow in this network, and minimum cuts are identified with closures for this relation. As a consequence, finding all minimum cuts reduces to a straightforward enumeration. Applications of this results arise in sensitivity and parametric analyses of networks, the vertex packing and maximum closu
责任
发表于 2025-3-28 10:44:12
http://reply.papertrans.cn/23/2300/229962/229962_40.png