scientific article
From MaRDI portal
zbMath0611.90073MaRDI QIDQ3751373
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveycomputational complexityexact algorithmslinear assignment problemsaverage performanceApproximate algorithmsrandomly generated test problemsNP-hard cases
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A distributed exact algorithm for the multiple resource constrained sequencing problem, A robust heuristic for the generalized assignment problem, Prioritizing replenishments of the piece picking area, A genetic algorithm for the generalised assignment problem, Generalized pole placement via static output feedback: a methodology based on projections, The \(k\)-cardinality assignment problem, Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem, A note on the complexity of the asymmetric traveling salesman problem, Spatio-temporal multi-robot routing, Effective algorithm and heuristic for the generalized assignment problem., Cut-and-solve: An iterative search strategy for combinatorial optimization problems, Worst case examples of an exterior point algorithm for the assignment problem, A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems, Single-machine scheduling with supporting tasks, A new model and hybrid approach for large scale inventory routing problems, Iterative state-space reduction for flexible computation, On multi-index assignment polytopes, Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study, Constrained weighted matchings and edge coverings in graphs, Computing improved optimal solutions to max-min flexible constraint satisfaction problems, Minimum deviation and balanced optimization: A unified approach
