scientific article; zbMATH DE number 3482073
From MaRDI portal
Publication:4065285
zbMATH Open0307.90051MaRDI QIDQ4065285FDOQ4065285
Authors: Pierre Hansen, L. Kaufman 
Publication date: 1973
Title of this publication is not available (Why is that?)
Numerical mathematical programming methods (65K05) Extremal problems in graph theory (05C35) Integer programming (90C10)
Cited In (12)
- New lower bounds for the triplanar assignment problem. Use of the classical model
- Selected topics on assignment problems
- Lower bounds for the axial three-index assignment problem
- A hybrid genetic algorithm for the three-index assignment problem
- Geometric three-dimensional assignment problems
- Linear-time separation algorithms for the three-index assignment polytope
- Three-dimensional axial assignment problems with decomposable cost coefficients
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- The three-dimensional assignment and partition problems. New lower bounds
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- An adaptive algorithm for solving the axial three-index assignment problem
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
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)
