Letter to the Editor—The Multidimensional Assignment Problem
From MaRDI portal
Publication:5549535
DOI10.1287/opre.16.2.422zbMath0164.50003OpenAlexW2088653780MaRDI QIDQ5549535
Publication date: 1968
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.16.2.422
Related Items (66)
A hybrid genetic algorithm for the three-index assignment problem ⋮ Asymptotic properties of random multidimensional assignment problems ⋮ Approximation algorithms for multi-dimensional assignment problems with decomposable costs ⋮ The three-dimensional bottleneck assignment problem with capacity constraints ⋮ The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems ⋮ Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment ⋮ Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces ⋮ Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming ⋮ Symmetry breaking constraints for value symmetries in constraint satisfaction ⋮ Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem ⋮ A survey for the quadratic assignment problem ⋮ Assignment problems: a golden anniversary survey ⋮ Branch and bound algorithms for the multidimensional assignment problem ⋮ Approximation algorithms for multi-index transportation problems with decomposable costs ⋮ Efficient sensor network management for asset localization ⋮ On the number of local minima for the multidimensional assignment problem ⋮ Asymptotic behavior of the expected optimal value of the multidimensional assignment problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Three-dimensional axial assignment problems with decomposable cost coefficients ⋮ Genetic Column Generation: Fast Computation of High-Dimensional Multimarginal Optimal Transport Problems ⋮ Computational Studies of Randomized Multidimensional Assignment Problems ⋮ On the Hamming distance in combinatorial optimization problems on hypergraph matchings ⋮ Time-cost tradeoff in a three-dimensional assignment problem ⋮ The multicommodity assignment problem: A network aggregation heuristic ⋮ On optimality of a polynomial algorithm for random linear multidimensional assignment problem ⋮ Landscape properties of the very large-scale and the variable neighborhood search metaheuristics for the multidimensional assignment problem ⋮ Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem ⋮ A bilinear programming formulation of the 3-dimensional assignment problem ⋮ A survey of dynamic network flows ⋮ Nonnegative tensors revisited: plane stochastic tensors ⋮ An LP-based algorithm for the data association problem in multitarget tracking. ⋮ Graph partitions for the multidimensional assignment problem ⋮ The travelling salesman problem and a class of polyhedra of diameter two ⋮ The three-dimensional assignment and partition problems. New lower bounds ⋮ Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem ⋮ Exact solution of emerging quadratic assignment problems ⋮ Random assignment problems ⋮ On a property of a three-dimensional matrix ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Selected topics on assignment problems ⋮ Local search heuristics for the multidimensional assignment problem ⋮ Solving the multidimensional assignment problem by a cross-entropy method ⋮ On multi-index assignment polytopes ⋮ Test problem generator for the multidimensional assignment problem ⋮ Facets of the three-index assignment polytope ⋮ New lower bounds for the triplanar assignment problem. Use of the classical model ⋮ Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies ⋮ On solving a hard quadratic 3-dimensional assignment problem ⋮ Linear-time separation algorithms for the three-index assignment polytope ⋮ Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems ⋮ Random multi-index matching problems ⋮ Scheduling sports competitions on multiple venues. ⋮ Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms ⋮ Barycenters for the Hellinger--Kantorovich Distance Over $\mathbb{R}^d$ ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors ⋮ Geometric three-dimensional assignment problems ⋮ Local Search Heuristics for the Multidimensional Assignment Problem ⋮ Clique facets of the axial and planar assignment polytopes ⋮ Lower bounds for the axial three-index assignment problem ⋮ Multidimensional assignment problem for multipartite entity resolution ⋮ Data-driven combinatorial optimization for sensor-based assessment of near falls ⋮ A variation of the assignment problem ⋮ The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm ⋮ A MIP model for scheduling India's general elections and police movement
This page was built for publication: Letter to the Editor—The Multidimensional Assignment Problem