scientific article; zbMATH DE number 151870

MaRDI QIDQ4031977zbMATH OpenFDO

Authors Rainer E. Burkard, Rüdiger Rudolf

Publication date 3 May 1993

zbMATH Keywords

axial three-dimensional assignmentboundsbranch-and-boundnonsmooth nonlinear programmingreduction methodssubgradient methods

Mathematics Subject Classification ID

Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10)

Recommendations

• An Algorithm for the Three-Index Assignment Problem
• Lower bounds for the axial three-index assignment problem
• An algorithm for the planar three-index assignment problem
• scientific article; zbMATH DE number 1894378
• Selected topics on assignment problems

Cited in

(12)

• Lower bounds for the axial three-index assignment problem
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Combining solutions of the axial assignment problem
• A heuristic method for solving integer-valued decompositional multiindex problems
• The three-dimensional assignment and partition problems. New lower bounds
• Exact solution of emerging quadratic assignment problems
• An Algorithm for the Three-Index Assignment Problem
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
• Selected topics on assignment problems
• A hybrid genetic algorithm for the three-index assignment problem
• A survey for the quadratic assignment problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4031977)