scientific article; zbMATH DE number 3482073

MaRDI QIDQ4065285zbMATH OpenFDO

Authors Pierre Hansen, L. Kaufman

Publication date 1973

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Extremal problems in graph theory (05C35) Integer programming (90C10)

Cited in

(12)

• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• Selected topics on assignment problems
• A hybrid genetic algorithm for the three-index assignment problem
• Lower bounds for the axial three-index assignment problem
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• The three-dimensional assignment and partition problems. New lower bounds
• Geometric three-dimensional assignment problems
• New lower bounds for the triplanar assignment problem. Use of the classical model
• An adaptive algorithm for solving the axial three-index assignment problem
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Linear-time separation algorithms for the three-index assignment polytope
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems

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 Q4065285)