衰退
发表于 2025-3-21 18:58:21
书目名称Combinatorial Optimization影响因子(影响力)<br> http://impactfactor.cn/2024/if/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization影响因子(影响力)学科排名<br> http://impactfactor.cn/2024/ifr/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization网络公开度<br> http://impactfactor.cn/2024/at/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization网络公开度学科排名<br> http://impactfactor.cn/2024/atr/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization被引频次<br> http://impactfactor.cn/2024/tc/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization被引频次学科排名<br> http://impactfactor.cn/2024/tcr/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization年度引用<br> http://impactfactor.cn/2024/ii/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization年度引用学科排名<br> http://impactfactor.cn/2024/iir/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization读者反馈<br> http://impactfactor.cn/2024/5y/?ISSN=BK0229958<br><br> <br><br>书目名称Combinatorial Optimization读者反馈学科排名<br> http://impactfactor.cn/2024/5yr/?ISSN=BK0229958<br><br> <br><br>
Folklore
发表于 2025-3-21 21:37:16
Hyperpaths and shortest hyperpaths,eneralized for a hyperpath. In particular, the shortest hyperpath problem is studied for a subclass of hyperpaths. Shortest hyperpath properties are derived from the classical one, and efficient algorithms are presented in detail.
recession
发表于 2025-3-22 02:04:31
http://reply.papertrans.cn/23/2300/229958/229958_3.png
丑恶
发表于 2025-3-22 07:25:11
Natalia Chaban,Serena Kelly,Anne-Marie Bradyoblems, polynomial-time algorithms are available for special classes of graphs. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both UGP and SMP in this class.
ALOFT
发表于 2025-3-22 12:22:48
http://reply.papertrans.cn/23/2300/229958/229958_5.png
合适
发表于 2025-3-22 15:46:23
https://doi.org/10.1007/BFb0083460algorithms; combinatorial optimization; combinatorics; operations research; optimization
合适
发表于 2025-3-22 19:40:30
978-3-540-51797-9Springer-Verlag Berlin Heidelberg 1989
不再流行
发表于 2025-3-22 23:13:10
Lecture Notes in Mathematicshttp://image.papertrans.cn/c/image/229958.jpg
Palter
发表于 2025-3-23 03:10:04
http://reply.papertrans.cn/23/2300/229958/229958_9.png
吹气
发表于 2025-3-23 08:57:58
Matthew Gibbons,Serena Kelly,Martin Hollandhe incidence matrix can be represented as a bipartite graph G=(X,Y,E), with the node sets partitioned into the sets X1, X2, Y1 en Y2, such that (a) there are no edges between X1 en Y2, and (b) the cardinality of X1+Y2 is maximum. Such a partition corresponds with the detection of complete and maxima