We address nonconvex mixed-integer bilinear problems where the main challenge is the computation of a tight upper bound for the objective function to be maximized. This can be obtained by using the recently developed concept of multiparametric disaggregation following the solution of a...

In order to improve the robustness of a railway system in station areas, this paper introduces an iterative approach to successively optimize the train routing through station areas and to enhance this solution by applying some changes to the timetable in a tabu search environment. We present...

The optimal design of supply chain networks is often examined based on one or more economic or other criteria (e.g., cost, profit environmental impact, danger, time). However, the efficiency of the derived solutions is often ignored. In this work, a recursive DEA (RDEA) algorithm is presented,...