scholarly journals Fast reliability ranking of matchstick minimal networks

Networks ◽  
2021 ◽  
Author(s):  
Vlad‐Florin Drǎgoi ◽  
Valeriu Beiu
Keyword(s):  

2019 ◽  
Vol 0 (0) ◽  
Author(s):  
Marcello Carioni ◽  
Alessandra Pluda

Abstract Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of the Steiner problem in several variants. Our goal is to compare the different notions of calibrations for the Steiner problem and for planar minimal partitions that are already present in the literature. The paper is then complemented with remarks on the convexification of the problem, on nonexistence of calibrations and on calibrations in families.



2021 ◽  
Vol 103 (2) ◽  
Author(s):  
Krishna Manoj ◽  
Samadhan A. Pawar ◽  
R. I. Sujith




AIChE Journal ◽  
2020 ◽  
Vol 66 (7) ◽  
Author(s):  
Chenglin Chang ◽  
Zuwei Liao ◽  
André L. H. Costa ◽  
Miguel J. Bagajewicz


1995 ◽  
Vol 82 (1) ◽  
pp. 101-116 ◽  
Author(s):  
I V Ptitsyna
Keyword(s):  






2017 ◽  
Vol 208 (5) ◽  
pp. 684-706
Author(s):  
I L Laut
Keyword(s):  


1994 ◽  
Vol 77 (2) ◽  
pp. 391-425 ◽  
Author(s):  
A O Ivanov ◽  
I V Ptitsyna ◽  
A A Tuzhilin




Sign in / Sign up

Export Citation Format

Share Document