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

We extend the (1 — 1/e)-approximation algorithm to a constant-factor approximation algorithms for a nonseparable assignment problem with applications in maximizing revenue for budget-constrained ...

The long-reigning champ of approximation One of the first and most famous approximation algorithms is for the traveling salesperson problem and is known as the Christofides-Serdyukov algorithm.

The following year, Saberi, Gharan and Mohit Singh of McGill University used the same approach to develop a new approximation algorithm for the ordinary traveling salesman problem.

A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association ...

June 5, 2024 — In a new paper in Science Advances on May 29, researchers at JPMorgan Chase, the U.S. Department of Energy’s (DOE) Argonne National Laboratory and Quantinuum have demonstrated clear ...

The eighth element of the opt argument specifies the type of finite difference approximation used to compute first- or second-order derivatives and whether the finite difference intervals, h, should ...