Globally optimizing mixed-integer quadratically-constrained quadratic programs. Major applications of mixed-integer quadratically-constrained quadratic programs (MIQCQP) include quality blending in process networks, separating objects in computational geometry, and portfolio optimization in finance. Specific instantiations of MIQCQP in process networks optimization problems include: pooling problems, distillation sequences, wastewater treatment and total water systems, hybrid energy systems, heat exchanger networks, reactor-separator-recycle systems, separation systems, data reconciliation, batch processes, crude oil scheduling, and natural gas production. Computational geometry problems formulated as MIQCQP include: point packing, cutting convex shapes from rectangles, maximizing the area of a convex polygon, and chip layout and compaction. Portfolio optimization in financial engineering can also be formulated as MIQCQP

References in zbMATH (referenced in 77 articles , 2 standard articles )

Showing results 1 to 20 of 77.
Sorted by year (citations)

1 2 3 4 next

  1. Ceselli, Alberto; Létocart, Lucas; Traversi, Emiliano: Dantzig-Wolfe reformulations for binary quadratic problems (2022)
  2. Del Pia, Alberto; Khajavirad, Aida: The running intersection relaxation of the multilinear polytope (2021)
  3. Kim, Cheolmin; Mehrotra, Sanjay: Solution approaches to linear fractional programming and its stochastic generalizations using second order cone approximations (2021)
  4. Kronqvist, Jan; Misener, Ruth: A disjunctive cut strengthening technique for convex MINLP (2021)
  5. Mahajan, Ashutosh; Leyffer, Sven; Linderoth, Jeff; Luedtke, James; Munson, Todd: Minotaur: a mixed-integer nonlinear optimization toolkit (2021)
  6. Nohra, Carlos J.; Raghunathan, Arvind U.; Sahinidis, Nikolaos: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs (2021)
  7. Bienstock, Daniel; Chen, Chen; Muñoz, Gonzalo: Outer-product-free sets for polynomial optimization and oracle-based cuts (2020)
  8. Ceccon, Francesco; Siirola, John D.; Misener, Ruth: SUSPECT: MINLP special structure detector for Pyomo (2020)
  9. Dey, Santanu S.; Kocuk, Burak; Santana, Asteroide: Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem (2020)
  10. Grimstad, Bjarne; Knudsen, Brage R.: Mathematical programming formulations for piecewise polynomial functions (2020)
  11. Gupte, Akshay; Kalinowski, Thomas; Rigterink, Fabian; Waterer, Hamish: Extended formulations for convex hulls of some bilinear functions (2020)
  12. Rebennack, Steffen; Krasko, Vitaliy: Piecewise linear function fitting via mixed-integer linear programming (2020)
  13. Santana, Asteroide; Dey, Santanu S.: The convex hull of a quadratic constraint over a polytope (2020)
  14. Xia, Wei; Vera, Juan C.; Zuluaga, Luis F.: Globally solving nonconvex quadratic programs via linear integer programming techniques (2020)
  15. Adams, Warren; Gupte, Akshay; Xu, Yibo: Error bounds for monomial convexification in polynomial optimization (2019)
  16. Bonami, Pierre; Lodi, Andrea; Schweiger, Jonas; Tramontani, Andrea: Solving quadratic programming by cutting planes (2019)
  17. Elloumi, Sourour; Lambert, Amélie: Global solution of non-convex quadratically constrained quadratic programs (2019)
  18. Furini, Fabio; Traversi, Emiliano; Belotti, Pietro; Frangioni, Antonio; Gleixner, Ambros; Gould, Nick; Liberti, Leo; Lodi, Andrea; Misener, Ruth; Mittelmann, Hans; Sahinidis, Nikolaos V.; Vigerske, Stefan; Wiegele, Angelika: QPLIB: a library of quadratic programming instances (2019)
  19. Göttlich, S.; Potschka, A.; Teuber, C.: A partial outer convexification approach to control transmission lines (2019)
  20. Lu, Cheng; Deng, Zhibin; Zhou, Jing; Guo, Xiaoling: A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming (2019)

1 2 3 4 next

Further publications can be found at: