A Long-Step, Cutting Plane Algorithm for Linear and Convex Programming

Author： Mitchell J.E.  

Publisher： Springer Publishing Company

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.99, Iss.1-4, 2000-12, pp. : 95-122

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 Cutting Plane Algorithm for Linear Reverse Convex Programs

By Moshirvaziri K.  

Annals of Operations Research, Vol. 105, Iss. 1-4, 2001-07 ,pp. : 201-212

Springer Publishing Company

Access to resources Recommend Favorite

A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs

By Hong Seok-Hee   Nagamochi Hiroshi  

Algorithmica, Vol. 58, Iss. 2, 2010-10 ,pp. : 433-460

Springer Publishing Company

Access to resources Recommend Favorite

An approximation algorithm for convex multi-objective programming problems

By Ehrgott Matthias  

Journal of Global Optimization, Vol. 50, Iss. 3, 2011-07 ,pp. : 397-416

Springer Publishing Company

Access to resources Recommend Favorite

Accelerating convergence of cutting plane algorithms for disjoint bilinear programming

By Ding Xiaosong   Al-Khayyal Faiz  

Journal of Global Optimization, Vol. 38, Iss. 3, 2007-07 ,pp. : 421-436

Springer Publishing Company

Access to resources Recommend Favorite

A Computational Study of a Cutting Plane Algorithm for University Course Timetabling

By Avella Pasquale   Vasil'Ev Igor  

Journal of Scheduling, Vol. 8, Iss. 6, 2005-12 ,pp. : 497-514

Springer Publishing Company

Access to resources Recommend Favorite