Computational investigations on 3-dimensional axial assignment problems

Branch-and-bound approaches for axial three-dimensional assignment problems are considered. Several branching schemes arising from facet defining inequalities are investigated. Further different bounding procedures are tested, such as reduction methods and bounds found by non-smooth non-linear 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.