Exact identification of critical nodes in sparse networks via new compact formulations

Author： Veremyev Alexander Boginski Vladimir Pasiliao Eduardo

ISSN： 1862-4472

Source： Optimization Letters, Vol.8, Iss.4, 2014-04, pp. : 1245-1259

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Compact formulations as a union of polyhedra

By Conforti Michele

Mathematical Programming, Vol. 114, Iss. 2, 2008-08 ,pp. : 277-289

Springer Publishing Company

Access to resources Recommend Favorite

Synchronization for Time‐Delayed Coupling Complex Dynamic Networks with Different Dimensional Nodes

ASIAN JOURNAL OF CONTROL, Vol. 17, Iss. 2, 2015-03 ,pp. : 664-674

John Wiley & Sons Inc

Access to resources Recommend Favorite

L₂–L_∞ nonlinear system identification via recurrent neural networks

By Ahn Choon

Nonlinear Dynamics, Vol. 62, Iss. 3, 2010-11 ,pp. : 543-552

Springer Publishing Company

Access to resources Recommend Favorite

Preprocessing sparse semidefinite programs via matrix completion

By Fujisawa Katsuki Fukuda Mituhiro Nakata Kazuhide

Optimization Methods and Software, Vol. 21, Iss. 1, 2006-02 ,pp. : 17-39

Taylor & Francis Ltd

Access to resources Recommend Favorite

Low‐rank approximation of tensors via sparse optimization

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 25, Iss. 2, 2018-03 ,pp. : n/a-n/a

John Wiley & Sons Inc

Access to resources Recommend Favorite