Computational Investigations on 3 - dimensionalAxial Assignment

Branch and bound approaches for axial three-dimensional assignment problems are considered. Several branching schemes arising from facet deening inequalities are investigated. Further diierent bounding procedures are tested, such as reduction methods and bounds found by non-smooth nonlinear programming methods. The computational tests show that the classical branching on one variable together with a reduction step and bounds obtained by subgradient methods yield the best results.