A Branch-and-Bound Algorithm for Multi-Level Fixed-Charge Problems

Publisher Website
Google Scholar
Abstract
Multi-level fixed-charge problems are mathematical optimization problems in which the separable portion of the objective function is the sum of piecewise continuous functions of a single variable. This paper describes a branch-and-bound algorithm that will find a global solution to this type of problem. The algorithm has the feature that a good feasible solution is generated at the start. Moreover, at each step of the algorithm an additional feasible solution may be generated for comparison with the best solution found previously.

This publication has 0 references indexed in Scilit: