Via the neighborhoods and elements, we define the scalarization functions for locally convex cones and discuss their properties. We consider the scalar optimization problems and obtain some results ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität ...

Analytics software leader FICO today announced the release of a true global mathematical optimization solver as part of FICO® Xpress 9.2 Optimization.

We present an implicit function theorem for set-valued maps associated with the solutions of generalized equations. As corollaries of this theorem, we derive both known and new results. Strong ...

Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue ...

Until now, it was unknown how much quantum computers had improved at optimization tasks given the rapid development of powerful hardware.