This class of problems includes the maximum generalized assignment problem (GAP) 1 and a distributed caching problem (DCP) described in this paper. Given a β-approximation algorithm for finding the ...

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...

Michel Gendreau, Gilbert Laporte, Alain Hertz, An Approximation Algorithm for the Traveling Salesman Problem with Backhauls, Operations Research, Vol. 45, No. 4 (Jul ...

The new algorithm is “absurdly fast,” said Daniel Spielman of Yale University. “I was actually inclined to believe … algorithms this good for this problem would not exist.” Maximum flow has been ...