An Additive Bounding Procedure for Combinatorial Optimization Problems
Operations Research · 1989 · Volume 37 · Issue 2
Abstract
We know that the effectiveness of the branch-and-bound algorithms proposed for the solution of combinatorial optimization problems greatly depends on the tightness of the available bounds. In this paper, we consider optimization problems with a linear objective function. We propose an additive approach for computing lower bounds that yields an increasing sequence of values. An application to the traveling salesman problem with precedence constraints is presented to exemplify the technique.
Keywords
networks/graphs: traveling salesman problem, programming, integer algorithms: bounding procedures for branch-and-bound algorithms
Enable JavaScript for citation tools and additional paper interactions.