Research from all publishers Notable progress has been made in the design and analysis of approximation methods for generalisations of the TSP. For instance, new work has explored the application ...

Next, we will study algorithms for NP-hard problems whose solutions are guaranteed to be within some approximation factor of the best possible solutions. Such algorithms are often quite efficient and ...

The algorithm we propose, IES, gives an approximate solution to the LHD problem regardless of its dimension and size with a theoretical performance guarantee. We introduce two upper bounds for the ...

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...

Such algorithms find approximate (slightly suboptimal) solutions to optimization problems in polynomial time. Unlike heuristics, approximation algorithms have provable performance guarantees: they ...

This paper proposes an algorithm that automatically translates the "continuum approximation" (CA) recipes for location problems into discrete designs. It applies to terminal systems, but can also be ...