Related content

Solving Difficult Multicommodity Problems with a Specialized Interior-Point Algorithm

By Castro Jordi  

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

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

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

On the Finite Termination of an Entropy Function Based Non-Interior Continuation Method for Vertical Linear Complementarity Problems

By Fang Shu-Cherng   Han Jiye   Huang Zheng-Hai   İlker Bİrbİl Ş.  

Journal of Global Optimization, Vol. 33, Iss. 3, 2005-11 ,pp. : 369-391

Springer Publishing Company

Access to resources Recommend Favorite