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 paper a system of `guided permit trading' is developed for SO<Subscript>2</Subscript>emissions reduction which considers permit trading as a bilateral andsequential process. This implies that in order to meet the deposition targetsat the end of the trading process, not every single trade transaction hasto meet...</subscript>

<Para ID="Par1">Locating a semi-obnoxious facility, like an airport or correctional center is typically a bi-criterion problem combining a convex objective function representing minimum transportation cost with a multi-extremal objective function representing the non-desirable part of the facility. Generic one...</para>

This paper analyses the intra-household allocation of time to show gender differences in childcare. In the framework of a general efficiency approach, hours spent on childcare by each parent are regressed against individual and household characteristics, for five samples (Denmark, France,...