An Additive Bounding Procedure for Combinatorial Optimization Problems

Publisher Website
Google Scholar
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.

This publication has 0 references indexed in Scilit: