Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm

ISSN： 0254-5330

Source： Annals of Operations Research, Vol.124, Iss.1-4, 2003-01, pp. : 35-48

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 full-Newton step feasible interior-point algorithm for [TEX equation: P_*(kappa )] -linear complementarity problems

By Wang G. Yu C. Teo K.

Journal of Global Optimization, Vol. 59, Iss. 1, 2014-05 ,pp. : 81-99

Springer Publishing Company

Access to resources Recommend Favorite

An interior-point Benders based branch-and-cut algorithm for mixed integer programs

By Naoum-Sawaya Joe Elhedhli Samir

Annals of Operations Research, Vol. 210, Iss. 1, 2013-11 ,pp. : 33-55

Springer Publishing Company

Access to resources Recommend Favorite

A multiprocessor interior point algorithm

By Östermark Ralf Saarinen Martin

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 25, Iss. 4, 1996-04 ,pp. : 84-100

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Parallel interior-point solver for structured quadratic programs: Application to financial planning problems

By Gondzio Jacek Grothey Andreas

Annals of Operations Research, Vol. 152, Iss. 1, 2007-07 ,pp. : 319-339

Springer Publishing Company

Access to resources Recommend Favorite

Parallel Interior Point Schemes for Solving Multistage Convex Programming

By Hegland M.

Annals of Operations Research, Vol. 108, Iss. 1-4, 2001-11 ,pp. : 75-85

Springer Publishing Company

Access to resources Recommend Favorite