Reformulations in mathematical programming: Definitions

7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008

Volumn , Issue , 2008, Pages 66-70

  Liberti, Leo ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Approximation; Narrowing; Opt reformulation; Relaxation

Indexed keywords

EID: 84883081750     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. C. Audet, P. Hansen, B. Jaumard, and G. Savard. Links between linear bilevel and mixed 0-1 programming problems. Journal of Optimization Theory and Applications, 93(2):273-300, 1997.
2. E.P. Gatzke, J.E. Tolsma, and P.I. Barton. Construction of convex relaxations using automated code generation techniques. Optimization and Engineering, 3:305-326, 2002.
3. L. Liberti. Reformulation and Convex Relaxation Techniques for Global Optimization. PhD thesis, Imperial College London, UK, March 2004.
4. L. Liberti. Reformulation techniques in mathematical programming, November 2007. Thèse d'Habilitation à Diriger des Recherches.
5. F. Margot. Pruning by isomorphism in branch-and-cut. Mathematical Programming, 94:71-90, 2002.
6. N. Mladenović, F. Plastria, and D. Urošević. Reformulation descent applied to circle packing problems. Computers and Operations Research, 32(9):2419-2434, 2005.
7. H. Sherali. Personal communication. June 2007.