Cutting Plane Algorithms and Approximate Lower Subdifferentiability

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.148, Iss.3, 2011-03, pp. : 455-470

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

On Global Optimality Conditions and Cutting Plane Algorithms

By Tuy H.

Journal of Optimization Theory and Applications, Vol. 118, Iss. 1, 2003-07 ,pp. : 201-216

Springer Publishing Company

Access to resources Recommend Favorite

Cutting plane algorithms for robust conic convex optimization problems

By Gomez J. Gomez W.

Optimization Methods and Software, Vol. 21, Iss. 5, 2006-10 ,pp. : 779-803

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximate and Exact Algorithms for Constrained (Un) Weighted Two-dimensional Two-staged Cutting Stock Problems

By Hifi M. Roucairol C.

Journal of Combinatorial Optimization, Vol. 5, Iss. 4, 2001-12 ,pp. : 465-494

Springer Publishing Company

Access to resources Recommend Favorite

Toward Optimal -Approximate Nearest Neighbor Algorithms

By Cary M.

Journal of Algorithms, Vol. 41, Iss. 2, 2001-11 ,pp. : 417-428

Elsevier

Access to resources Recommend Favorite

ALGORITHMS FOR COMPUTING APPROXIMATE REPETITIONS IN MUSICAL SEQUENCES

By CAMBOUROPOULOS EMILIOS

International Journal of Computer Mathematics, Vol. 79, Iss. 11, 2002-01 ,pp. : 1135-1148

Taylor & Francis Ltd

Access to resources Recommend Favorite