GloMIQO

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 25 articles , 2 standard articles )

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

1 2 next

  1. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems (2016)
  2. Birgin, E.G.; Lobato, R.D.; Martínez, J.M.: Packing ellipsoids by nonlinear optimization (2016)
  3. Castro, Pedro M.: Normalized multiparametric disaggregation: an efficient relaxation for mixed-integer bilinear problems (2016)
  4. Domes, Ferenc; Neumaier, Arnold: Linear and parabolic relaxations for quadratic constraints (2016)
  5. Ma, Xiaohua; Gao, Yuelin; Liu, Xia: A new branch and bound algorithm for integer quadratic programming problems (2016)
  6. Duan, Qianqian; Yang, Genke; Xu, Guanglin; Duan, Xueyan: A global optimization approach for a class of MINLP problems with applications to crude oil scheduling problem (2015)
  7. Frank, Stephen M.; Rebennack, Steffen: Optimal design of mixed AC-DC distribution systems for commercial buildings: a nonconvex generalized Benders decomposition approach (2015)
  8. Gleixner, Ambros M.: Exact and fast algorithms for mixed-integer nonlinear programming (2015)
  9. Kirst, Peter; Stein, Oliver; Steuermann, Paul: Deterministic upper bounds for spatial branch-and-bound methods in global minimization with nonconvex constraints (2015)
  10. Misener, Ruth; Smadbeck, James B.; Floudas, Christodoulos A.: Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 (2015)
  11. Berthold, Timo; Gleixner, Ambros M.: Undercover: a primal MINLP heuristic exploring a largest sub-MIP (2014)
  12. Castro, Pedro M.; Grossmann, Ignacio E.: Optimality-based bound contraction with multiparametric disaggregation for the global optimization of mixed-integer bilinear problems (2014)
  13. Jones, Donald R.: A fully general, exact algorithm for nesting irregular shapes (2014)
  14. Kallrath, Josef; Rebennack, Steffen: Cutting ellipses from area-minimizing rectangles (2014)
  15. Misener, Ruth; Floudas, Christodoulos A.: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations (2014)
  16. Misener, Ruth; Floudas, Christodoulos A.: A framework for globally optimizing mixed-integer signomial programs (2014)
  17. Newby, Eric; Ali, M.M.: A note on convex reformulation schemes for mixed integer quadratic programs (2014)
  18. Tsoukalas, A.; Mitsos, A.: Multivariate McCormick relaxations (2014)
  19. Zorn, Keith; Sahinidis, Nikolaos V.: Global optimization of general nonconvex problems with intermediate polynomial substructures (2014)
  20. Zorn, Keith; Sahinidis, Nikolaos V.: Global optimization of general non-convex problems with intermediate bilinear substructures (2014)

1 2 next


Further publications can be found at: http://helios.princeton.edu/GloMIQO/publications.html