Algorithms for Finite and Semi-Infinite Min–Max–Min Problems Using Adaptive Smoothing Techniques

ISSN： 0022-3239

Source： Journal of Optimization Theory and Applications, Vol.119, Iss.3, 2003-12, pp. : 421-457

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 the Use of Augmented Lagrangians in the Solution of Generalized Semi-Infinite Min-Max Problems

By Polak Elijah Royset Johannes

Computational Optimization and Applications, Vol. 31, Iss. 2, 2005-06 ,pp. : 173-192

Springer Publishing Company

Access to resources Recommend Favorite

An aggregate deformation homotopy method for min-max-min problems with max-min constraints

By Xiong Hui-juan Yu Bo

Computational Optimization and Applications, Vol. 47, Iss. 3, 2010-11 ,pp. : 501-527

Springer Publishing Company

Access to resources Recommend Favorite

Approximation algorithms for MAX-MIN tiling

By Berman P. DasGupta B. Muthukrishnan S.

Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. : 122-134

Elsevier

Access to resources Recommend Favorite

Algorithms with Adaptive Smoothing for Finite Minimax Problems

By Polak E. Royset J. O. Womersley R. S.

Journal of Optimization Theory and Applications, Vol. 119, Iss. 3, 2003-12 ,pp. : 459-484

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms for Min-Max Tree Partition

By Guttmann-Beck N. Hassin R.

Journal of Algorithms, Vol. 24, Iss. 2, 1997-08 ,pp. : 266-286

Academic Press

Access to resources Recommend Favorite