Couenne

Branching and bounds tightening techniques for non-connvex MINLP. Many industrial problems can be naturally formulated using mixed integer non-linear programming (MINLP) models and can be solved by spatial Branch& Bound (sBB) techniques. We study the impact of two important parts of sBB methods: bounds tightening (BT) and branching strategies. We extend a branching technique originally developed for MILP, reliability branching, to the MINLP case. Motivated by the demand for open-source solvers for real-world MINLP problems, we have developed an sBB software package named couenne (Convex Over- and Under-ENvelopes for Non-linear Estimation) and used it for extensive tests on several combinations of BT and branching techniques on a set of publicly available and real-world MINLP instances. We also compare the performance of couenne with a state-of-the-art MINLP solver.


References in zbMATH (referenced in 50 articles )

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

1 2 3 next

  1. Hartillo, M. I.; Jiménez-Cobano, J. M.; Ucha, J. M.: Finding multiple solutions in nonlinear integer programming with algebraic test-sets (2018)
  2. Jiménez Cobano, José Manuel; Ucha Enríquez, José María: Finding multiplies solutions for non-linear integer programming (2018)
  3. Schweiger, Jonas: Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty (2018)
  4. Belotti, Pietro; Berthold, Timo: Three ideas for a feasibility pump for nonconvex MINLP (2017)
  5. Billionnet, Alain; Elloumi, Sourour; Lambert, Amélie; Wiegele, Angelika: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation (2017)
  6. Fampa, Marcia; Lee, Jon; Melo, Wendel: On global optimization with indefinite quadratics (2017)
  7. Gleixner, Ambros M.; Berthold, Timo; Müller, Benjamin; Weltge, Stefan: Three enhancements for optimization-based bound tightening (2017)
  8. Hart, William E.; Laird, Carl D.; Watson, Jean-Paul; Woodruff, David L.; Hackebeil, Gabriel A.; Nicholson, Bethany L.; Siirola, John D.: Pyomo -- optimization modeling in Python (2017)
  9. Hijazi, Hassan; Coffrin, Carleton; Van Hentenryck, Pascal: Convex quadratic relaxations for mixed-integer nonlinear programs in power systems (2017)
  10. Khan, Kamil A.; Watson, Harry A. J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  11. Lee, Jon; Skipper, Daphne: Virtuous smoothing for global optimization (2017)
  12. Scioletti, Michael S.; Newman, Alexandra M.; Goodman, Johanna K.; Zolan, Alexander J.; Leyffer, Sven: Optimal design and dispatch of a system of diesel generators, photovoltaics and batteries for remote locations (2017)
  13. Araya, Ignacio; Reyes, Victor: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects (2016)
  14. Dalkiran, Evrim; Sherali, Hanif D.: RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (2016)
  15. Gassmann, Horand; Ma, Jun; Martin, Kipp: Communication protocols for options and results in a distributed optimization environment (2016)
  16. Lejeune, Miguel A.; Margot, François: Solving chance-constrained optimization problems with stochastic quadratic inequalities (2016)
  17. Vismara, Philippe; Coletta, Remi; Trombettoni, Gilles: Constrained global optimization for wine blending (2016)
  18. Bao, Xiaowei; Khajavirad, Aida; Sahinidis, Nikolaos V.; Tawarmalani, Mohit: Global optimization of nonconvex problems with multilinear intermediates (2015)
  19. Gago-Vargas, J.; Hartillo, I.; Puerto, J.; Ucha, J. M.: An improved test set approach to nonlinear integer problems with applications to engineering design (2015)
  20. Humpola, Jesco; Fügenschuh, Armin; Lehmann, Thomas: A primal heuristic for optimizing the topology of gas networks based on dual information (2015)

1 2 3 next