Degeneracy Subgraph of the Lemke Complementary Pivot Algorithm and Anticycling Rule

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.94, Iss.2, 1997-08, pp. : 409-423

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

Abstract

Related content

A simulated annealing algorithm for the maximum planar subgraph problem

By Poranen T.

International Journal of Computer Mathematics, Vol. 81, Iss. 5, 2004-05 ,pp. : 555-568

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Dual Projective Pivot Algorithm for Linear Programming

By Pan Ping-Qi

Computational Optimization and Applications, Vol. 29, Iss. 3, 2004-12 ,pp. : 333-346

Springer Publishing Company

Access to resources Recommend Favorite

An affine-scaling pivot algorithm for linear programming

By Pan Ping-Qi

Optimization, Vol. 62, Iss. 4, 2013-04 ,pp. : 431-445

Taylor & Francis Ltd

Access to resources Recommend Favorite

A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph

By Auletta V. Dinitz Y. Nutov Z. Parente D.

Journal of Algorithms, Vol. 32, Iss. 1, 1999-07 ,pp. : 21-30

Academic Press

Access to resources Recommend Favorite

A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics

By Schietgat Leander Ramon Jan Bruynooghe Maurice

Annals of Mathematics and Artificial Intelligence, Vol. 69, Iss. 4, 2013-12 ,pp. : 343-376

Springer Publishing Company

Access to resources Recommend Favorite