Table of Contents Author Guidelines Submit a Manuscript
Advances in Operations Research
Volume 2015, Article ID 784817, 13 pages
http://dx.doi.org/10.1155/2015/784817
Research Article

Two New Reformulation Convexification Based Hierarchies for 0-1 MIPs

Sorbonne Universités, UPMC Univ Paris 06, LIP6 UMR 7606, 4 Place Jussieu, 75005 Paris, France

Received 28 July 2015; Accepted 5 October 2015

Academic Editor: Ching-Jong Liao

Copyright © 2015 Hacene Ouzia. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. B. Korte and J. Vygen, Combinatorial Optimization: Theory and Algorithms, Algorithms and Combinatorics, Springer, 3rd edition, 2005.
  2. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
  3. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, vol. A of Algorithms and Combinatorics, Springer, Berlin, Germany, 2003.
  4. A. Schrijver, Combinatorial Optimization: Polyhedra and Efficiency, vol. 24 of Algorithms and Combinatorics, Springer, Berlin, Germany, 2003.
  5. E. Balas, S. Ceria, and G. Cornuéjols, “A lift-and-project cutting plane algorithm for mixed 0-1 programs,” Mathematical Programming, vol. 58, no. 1–3, pp. 295–324, 1993. View at Publisher · View at Google Scholar · View at Scopus
  6. J. B. Lasserre, “An explicit exact SDP relaxation for nonlinear 0-1 programs,” in Integer Programming and Combinatorial Optimization, Lectures Notes in Computer Science, pp. 293–303, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  7. L. Lovász and A. Schrijver, “Cones of matrices and set-functions and 0-1 optimization,” SIAM Journal on Optimization, vol. 1, no. 2, pp. 166–190, 1991. View at Publisher · View at Google Scholar
  8. M. Minoux and H. Ouzia, “DRL: a hierarchy of strong block-decomposable linear relaxations for 0-1 MIPs,” Discrete Applied Mathematics, vol. 158, no. 18, pp. 2031–2048, 2010. View at Publisher · View at Google Scholar
  9. H. D. Sherali and W. P. Adams, “A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems,” SIAM Journal on Discrete Mathematics, vol. 3, no. 3, pp. 411–430, 1990. View at Publisher · View at Google Scholar
  10. H. D. Sherali and W. P. Adams, “A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems,” Discrete Applied Mathematics, vol. 52, no. 1, pp. 83–106, 1994. View at Publisher · View at Google Scholar · View at Scopus
  11. H. D. Sherali and W. P. Adams, A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems, vol. 31 of Nonconvex Optimization and Its Applications, Springer, New York, NY, USA, 1999. View at Publisher · View at Google Scholar
  12. D. Bienstock and M. Zuckerberg, “Subset algebra lift operators for 0-1 integer programming,” SIAM Journal on Optimization, vol. 15, no. 1, pp. 63–95, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. H. Ouzia, Hiérarchies de relaxations semi-algébriques pour des programmes linéeaires mixtes 0-1: théorie et applications [Ph.D. thesis], Université Pierre et Marie Curie, Paris, France, 2008.
  14. M. Zuckerberg, A set theoretic approach to lifting procedures for 0-1 integer programming [Ph.D. thesis], Columbia University, New York, NY, USA, 2004.
  15. M. Laurent, “A comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre relaxations for 0-1 programming,” Mathematics of Operations Research, vol. 28, no. 3, pp. 470–496, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  16. M. Tawarmalani and N. V. Sahinidis, Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications, Nonconvex Optimization and its Applications, Springer-Verlag, New York, NY, USA, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  17. M. Tawarmalani and N. V. Sahinidis, “Convex extensions and envelopes of lower semi-continuous functions,” Mathematical Programming, Series B, vol. 93, no. 2, pp. 247–263, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. J. B. Lasserre and T. P. Thanh, “Convex underestimators of polynomials,” Journal of Global Optimization, vol. 56, no. 1, pp. 1–25, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. J. E. Falk and K. R. Hoffman, “A successive underestimation method for concave minimization problems,” Mathematics of Operations Research, vol. 1, no. 3, pp. 251–259, 1976. View at Publisher · View at Google Scholar · View at Scopus
  20. J. P. Aubin and I. Ekeland, “Estimates of the duality gap in nonconvex optimization,” Mathematics of Operations Research, vol. 1, no. 3, pp. 225–245, 1976. View at Publisher · View at Google Scholar · View at Scopus
  21. E. Balas and J. B. Mazzola, “Nonlinear 0-1 programming: I. Linearization techniques,” Mathematical Programming, vol. 30, no. 1, pp. 1–21, 1984. View at Publisher · View at Google Scholar · View at Scopus
  22. H. D. Sherali and A. Alameddine, “An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes,” Annals of Operations Research, vol. 25, no. 1, pp. 197–209, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  23. H. D. Sherali, “Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets,” Acta Mathematica Vietnamica, vol. 22, no. 1, pp. 245–270, 1997. View at Google Scholar
  24. Y. Crama, “Concave extensions for nonlinear 0-1 maximization problems,” Mathematical Programming, vol. 61, no. 1, pp. 53–60, 1993. View at Publisher · View at Google Scholar · View at Scopus
  25. H. D. Sherali and W. P. Adams, “Reformulation-linearization techniques for discrete optimization problems,” in Handbook of Combinatorial Optimization, D. Z. Du and P. M. Pardalos, Eds., pp. 479–532, Springer, New York, NY, USA, 1999. View at Publisher · View at Google Scholar
  26. D. Cox, J. Little, and D. O'Shea, Ideals, Varieties and Algorithms, Springer, 2nd edition, 1996.
  27. D. Cox, J. Little, and D. O'Shea, Using Algebraic Geometry, Springer, 2nd edition, 2004.
  28. P. C. Chu and J. E. Beasley, “A genetic algorithm for the multidimensional knapsack problem,” Journal of Heuristics, vol. 4, no. 1, pp. 63–86, 1998. View at Publisher · View at Google Scholar · View at Scopus