排序方式: 共有4条查询结果,搜索用时 0 毫秒
1
1.
Kavitha Telikepalli Király Tamás Matuschke Jannik Schlotter Ildikó Schmidt-Kraepelin Ulrike 《Mathematical Programming》2022,192(1-2):567-595
Mathematical Programming - Let G be a digraph where every node has preferences over its incoming edges. The preferences of a node extend naturally to preferences over branchings, i.e., directed... 相似文献
2.
Jannik Matuschke S. Thomas McCormick Gianpaolo Oriolo Britta Peis Martin Skutella 《Operations Research Letters》2017,45(1):53-59
We present a new robust optimization model for the problem of maximizing the amount of flow surviving the attack of an interdictor. Given some path flow, our model allows the interdictor to specify the amount of flow removed from each path individually. In contrast to previous models, for which no efficient algorithms are known, the most important basic variants of our model can be solved in poly-time. We also consider extensions where there is a budget to set the interdiction costs. 相似文献
3.
The polarographic behaviour of the anions nitrosodicyanmethanide and nitrodicyanmethanide is described. Contrary to the homologous oxoanions nitrite and nitrate the dicyanmethanidooxoanions are reduced, hydroxylamine being formed as an intermediate product, The results are discussed, assuming an influence of the asymmetric structure of the anions. 相似文献
4.
1