This is a response to [Jordahl, H., Poutvaara, P., & Tuomala, J. (2009). Comment on education returns of wage earners and self-employed workers. Economics of Education Review 28]. We acknowledge that econometrics have improved since the time our original paper was written, so that the choice of...

In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes...

We describe the minimum volume simplex enclosure problem (MVSEP), which is known to be a global optimization problem, and further investigate its multimodality. The problem is a basis for several (unmixing) methods that estimate so-called endmembers and fractional values in a linear mixing...

Interval branch-and-bound (B&B) algorithms are powerful methods which look for guaranteed solutions of global optimisation problems. The computational effort needed to reach this aim, increases exponentially with the problem dimension in the worst case. For separable functions this effort is...

In this work, the problem of a company or chain (the leader) that considers the reaction of a competitor chain (the follower) is studied. In particular, the leader wants to set up a single new facility in a planar market where similar facilities of the follower, and possibly of its own chain,...

The modernization processes of hydraulic infrastructures from old open channels to pressurized networks have increased water use efficiency along with a dramatic increase of energy consumptions. The significant energy requirements associated with the increment of the energy tariffs for...