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 ...

Approximation algorithms for the TSP endeavour to provide efficient, near‐optimal solutions where exact methods prove computationally prohibitive.

Since cutting stock problems are well known to be NP-hard, it is prohibitive to obtain optimal solutions. We develop approximation algorithms for different purposes: quick response algorithms for ...