Finding Total Unimodularity in Optimization Problems Solved by Linear Programs

ISSN： 0178-4617

Source： Algorithmica, Vol.59, Iss.2, 2011-02, pp. : 256-268

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

On Linear and Linearized Generalized Semi-Infinite Optimization Problems

By Rückmann J-J.

Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. : 191-208

Springer Publishing Company

Access to resources Recommend Favorite

One-Parametric Linear-Quadratic Optimization Problems

By Jonker P. Still G. Twilt F.

Annals of Operations Research, Vol. 101, Iss. 1-4, 2001-01 ,pp. : 221-253

Springer Publishing Company

Access to resources Recommend Favorite

Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems

By Bompadre Agustín

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 659-700

Springer Publishing Company

Access to resources Recommend Favorite

On Compact Formulations for Integer Programs Solved by Column Generation

By Villeneuve Daniel

Annals of Operations Research, Vol. 139, Iss. 1, 2005-10 ,pp. : 375-388

Springer Publishing Company

Access to resources Recommend Favorite

A Superlinearly Convergent SSLE Algorithm for Optimization Problems with Linear Complementarity Constraints

By Li Jian-Ling Jian Jin-Bao

Journal of Global Optimization, Vol. 33, Iss. 4, 2005-12 ,pp. : 477-510

Springer Publishing Company

Access to resources Recommend Favorite