Reformulation techniques in mathematical programming

Citations of this article
Mendeley users who have this article in their library.
Get full text


The special issue of Discrete Applied Mathematics (DAM) presents some important papers on Reformulation Techniques in Mathematical Programming. Reformulations may change any combination of parameters, variables, objectives and constraints in a mathematical program. The Reformulation-Linearization Technique (RLT) and the symbolic reformulation are both designed to obtain a tight bound for the objective function value of Mixed-Integer Nonlinear Programming (MINLP) problems. This issue contains papers by Billionnet et al., Gueye and Michelon, Hansen and Meyer, Sherali and Adams, that either propose new reformulations in mathematical programming or employ reformulation techniques to improve the state of the art in theoretical or applied fields. Eleven papers out of twenty-one submissions were accepted for publication.




Liberti, L., & Maculan, N. (2009, March 28). Reformulation techniques in mathematical programming. Discrete Applied Mathematics, 157(6), 1165–1166.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free