A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints

By Júdice Joaquim   Sherali Hanif   Ribeiro Isabel   Faustino Ana  

Journal of Global Optimization, Vol. 36, Iss. 1, 2006-09 ,pp. : 89-114

Springer Publishing Company

Access to resources Recommend Favorite

A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

By Ahuja Ravindra K.   Hochbaum Dorit S.   Orlin James B.  

Algorithmica, Vol. 39, Iss. 3, 2004-04 ,pp. : 189-208

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

Parallelization of a graph‐cut based algorithm for hierarchical clustering of web documents

By  

CONCURRENCY AND COMPUTATION: PRACTICE & EXPERIENCE (ELECTRONIC), Vol. 27, Iss. 17, 2015-12 ,pp. : 5156-5176

John Wiley & Sons Inc

Access to resources Recommend Favorite

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

By Xiao Mingyu   Cai Leizhen   Yao Andrew  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 510-520

Springer Publishing Company

Access to resources Recommend Favorite