References in zbMATH (referenced in 457 articles )

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

1 2 3 ... 21 22 23 next

  1. Cozad, Alison; Sahinidis, Nikolaos V.: A global MINLP approach to symbolic regression (2018)
  2. Gupta, Srikant; Ali, Irfan; Ahmed, Aquil: Multi-objective capacitated transportation problem with mixed constraint: a case study of certain and uncertain environment (2018)
  3. Kılınç, Mustafa R.; Sahinidis, Nikolaos V.: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON (2018)
  4. Montanher, Tiago; Neumaier, Arnold; Domes, Ferenc: A computational study of global optimization solvers on two trust region subproblems (2018)
  5. Sun, Yan; Hrušovský, Martin; Zhang, Chen; Lang, Maoxiang: A time-dependent fuzzy programming approach for the green multimodal routing problem with rail service capacity uncertainty and road traffic congestion (2018)
  6. Zhou, Kai; Kılınç, Mustafa R.; Chen, Xi; Sahinidis, Nikolaos V.: An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver (2018)
  7. Belotti, Pietro; Berthold, Timo: Three ideas for a feasibility pump for nonconvex MINLP (2017)
  8. Cafieri, Sonia; Omheni, Riadh: Mixed-integer nonlinear programming for aircraft conflict avoidance by sequentially applying velocity and heading angle changes (2017)
  9. Chen, Huey-Kuo: A heuristic for the doubly constrained entropy distribution/assignment problem (2017)
  10. Fendl, Hannes; Neumaier, Arnold; Schichl, Hermann: Certificates of infeasibility via nonsmooth optimization (2017)
  11. Gerard, D.; Köppe, M.; Louveaux, Q.: Guided dive for the spatial branch-and-bound (2017)
  12. Kallrath, Josef: Packing ellipsoids into volume-minimizing rectangular boxes (2017)
  13. Khan, Kamil A.; Watson, Harry A. J.; Barton, Paul I.: Differentiable McCormick relaxations (2017)
  14. Lima, Ricardo M.; Grossmann, Ignacio E.: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (2017)
  15. Lu, Hao-Chun: Improved logarithmic linearizing method for optimization problems with free-sign pure discrete signomial terms (2017)
  16. Newby, Eric; Ali, M. M.: Linear transformation based solution methods for non-convex mixed integer quadratic programs (2017)
  17. Puranik, Yash; Sahinidis, Nikolaos V.: Bounds tightening based on optimality conditions for nonconvex box-constrained optimization (2017)
  18. Puranik, Yash; Sahinidis, Nikolaos V.: Domain reduction techniques for global NLP and MINLP optimization (2017)
  19. Rizk-Allah, R. M.; Abo-Sinna, Mahmoud A.: Integrating reference point, Kuhn-Tucker conditions and neural network approach for multi-objective and multi-level programming problems (2017)
  20. Abe, Masayuki; Hoshino, Fumitaka; Ohkubo, Miyako: Design in type-I, run in type-III: fast and scalable bilinear-type conversion using integer programming (2016)

1 2 3 ... 21 22 23 next