scientific article; zbMATH DE number 3240945
From MaRDI portal
Publication:5528346
Cited in
(19)- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Lower bounds for the axial three-index assignment problem
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- Linear-time separation algorithms for the three-index assignment polytope
- Multidimensional assignment problem for multipartite entity resolution
- Facets of the three-index assignment polytope
- An adaptive algorithm for solving the axial three-index assignment problem
- On multi-index assignment polytopes
- Exact solution of emerging quadratic assignment problems
- Nonnegative tensors revisited: plane stochastic tensors
- The multi-story space assignment problem
- Fairer comparisons for travelling salesman problem solutions using hash functions
- Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem
- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
- Solution approaches to the three-index assignment problem
- Asymptotic results for random multidimensional assignment problems
- A hybrid genetic algorithm for the three-index assignment problem
- A survey for the quadratic assignment problem
- A survey of dynamic network flows
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 Q5528346)
