New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities

Documenti analoghi

• Concave tents: a new tool for constructing concave reformulations of a large class of nonconvex optimization problems
  di: Gabl, Markus
  Pubblicazione: (2024)
• Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
  di: Li, Yu-Wei, et al.
  Pubblicazione: (2025)
• Optimality conditions for bilevel programs via Moreau envelope reformulation
  di: Bai, Kuang, et al.
  Pubblicazione: (2023)
• An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
  di: Zhou, Junpeng, et al.
  Pubblicazione: (2023)
• A second-order cone representable class of nonconvex quadratic programs
  di: Dey, Santanu S., et al.
  Pubblicazione: (2025)