In the past decade, Graphics Processing Units have played an important role in the field of
high-performance computing and they still advance new fields such as IoT, autonomous …

Solving optimization problems with parallel algorithms has a long tradition in OR. Its future
relevance for solving hard optimization problems in many fields, including finance, logistics …

The parallel computing power offered by graphic processing units (GPUs) has been recently
exploited to support general purpose applications–by exploiting the availability of general …

One of the crucial factors in achieving a high punctuality in railway traffic systems, is the
ability to effectively reschedule the trains when disturbances occur. The railway traffic …

In this paper, we revisit the design and implementation of Branch-and-Bound (B&B)
algorithms for solving large combinatorial optimization problems on GPU-enhanced multi …

Abstract Agent Based Modelling (ABM) is an approach for modelling dynamic systems and
studying complex and emergent behaviour. ABMs have been widely applied in diverse …

In the last decade, Graphics Processing Units (GPUs) have gained an increasing popularity
as accelerators for High Performance Computing (HPC) applications. Recent GPUs are not …

Initially introduced as special-purpose accelerators for graphics applications, graphics
processing units (GPUs) have now emerged as general purpose computing platforms for a …

In many cases there is still a large gap between the performance of current optimization
technology and the requirements of real-world applications. As in the past, performance will …

Abstract Branch-and-Bound (B&B) algorithms are tree-based exploratory methods for
solving combinatorial optimization problems exactly to optimality. These problems are often …