Graph algorithms and combinatorial optimisation form a pivotal area of research that underpins many modern computational applications. At their core, graph algorithms provide systematic methods for ...

Recently, a research team from Hokkaido University made significant progress in the complexity study of the Hitting Geodesic Intervals (HGI) problem. The HGI problem aims to find a small set of ...

This paper presents a graph cut approach to the image segmentation task. Considering the image to be a directed graph with two nodes representing the source (object) and the sink (background), the ...

Back in the hazy olden days of the pre-2000s, navigating between two locations generally required someone to whip out a paper map and painstakingly figure out the most optimal route between those ...

The Journal of the Operational Research Society, Vol. 58, No. 12 (Dec., 2007), pp. 1642-1651 (10 pages) In open vehicle routing problems, the vehicles are not required to return to the depot after ...

We give a branch-and-cut algorithm for solving linear programs (LPs) with continuous separable piecewise-linear cost functions (PLFs). Models for PLFs use continuous variables in special-ordered sets ...