Reformulation techniques in mathematical programming

Discrete Applied Mathematics

Volumn 157, Issue 6, 2009, Pages 1165-1166

  Liberti, Leo ^a   Maculan, Nelson ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 61849166710     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2008.10.016     Document Type: Editorial

References (7)

1. Audet C., Hansen P., Jaumard B., and Savard G. Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications 93 2 (1997) 273-300
2. L. Liberti, Reformulations in mathematical programming: Definitions, in: R. Aringhieri, R. Cordone, and G. Righini (Eds.), in: Proc. of the 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, Crema, 2008. Università Statale di Milano, pp. 66-70
3. L. Liberti, Reformulations in mathematical programming: Definitions and systematics. RAIRO-RO (in press)
4. McCormick G.P. Computability of global solutions to factorable nonconvex programs: Part I - Convex underestimating problems. Mathematical Programming 10 (1976) 146-175
5. Sherali H.D., and Adams W.P. A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems (1999), Kluwer Academic Publishers, Dodrecht
6. Smith E.M.B., and Pantelides C.C. A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers & Chemical Engineering 23 (1999) 457-478
7. Tawarmalani M., and Sahinidis N.V. Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99 (2004) 563-591