User menu

Strong and compact relaxations in the original space using a compact extended formulation

Bibliographic reference Van Vyve, Mathieu ; Wolsey, Laurence. Strong and compact relaxations in the original space using a compact extended formulation. In: EURO Journal on Computational Optimization, Vol. 1, no.1, p. 71-80 (2013)
Permanent URL http://hdl.handle.net/2078.1/130403
  1. Benders J. F., Partitioning procedures for solving mixed-variables programming problems, 10.1007/bf01386316
  2. Conforti Michele, Cornuéjols Gérard, Zambelli Giacomo, Extended formulations in combinatorial optimization, 10.1007/s10288-010-0122-z
  3. Christof T, Loebel A (1997) Porta—a polyhedron representation transformation algorithm. Available at http://typo.zib.de/opt-long-projects/Software/Porta/
  4. Rardin Ronald L., Wolsey Laurence A., Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems, 10.1016/0377-2217(93)90263-m
  5. Schrijver A (1986) Theory of linear and integer programming. Wiley, Hoboken
  6. Vanderbeck F, Wolsey LA (2010) Reformulation and decomposition of integer programs. In: Jünger M et al (eds) 50 Years of Integer Programming 1958–2008. Springer, Berlin, pp 431–502