Related content

Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2

By Misener Ruth   Smadbeck James B.   Floudas Christodoulos A.  

Optimization Methods and Software, Vol. 30, Iss. 1, 2015-01 ,pp. : 215-249

Taylor & Francis Ltd

Access to resources Recommend Favorite

Complete characterizations of stable Farkas’ lemma and cone-convex programming duality

By Jeyakumar V.  

Mathematical Programming, Vol. 114, Iss. 2, 2008-08 ,pp. : 335-347

Springer Publishing Company

Access to resources Recommend Favorite

Conic mixed-integer rounding cuts

By Atamtürk Alper  

Mathematical Programming, Vol. 122, Iss. 1, 2010-03 ,pp. : 1-20

Elsevier

Access to resources Recommend Favorite

Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs

By Köppe M.   Queyranne M.   Ryan C.  

Journal of Optimization Theory and Applications, Vol. 146, Iss. 1, 2010-07 ,pp. : 137-150

Springer Publishing Company

Access to resources Recommend Favorite

Foundation-penalty cuts for mixed-integer programs

By Glover F.   Sherali H.D.  

Operations Research Letters, Vol. 31, Iss. 4, 2003-07 ,pp. : 245-253

Elsevier

Access to resources Recommend Favorite