Letter to the Editor—The Multidimensional Assignment Problem
From MaRDI portal
Publication:5549535
DOI10.1287/OPRE.16.2.422zbMATH Open0164.50003OpenAlexW2088653780MaRDI QIDQ5549535FDOQ5549535
Authors: W. P. Pierskalla
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
Cited In (67)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
- Index matrices as a cost optimization tool of resource provisioning in uncertain cloud computing environment
- Vertex Nomination Between Graphs via Spectral Embedding and Quadratic Programming
- Genetic column generation: fast computation of high-dimensional multimarginal optimal transport problems
- 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
- Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
- Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
- A MIP model for scheduling India's general elections and police movement
- Computational studies of randomized multidimensional assignment problems
- New lower bounds for the triplanar assignment problem. Use of the classical model
- Branch and bound algorithms for the multidimensional assignment problem
- Scheduling sports competitions on multiple venues.
- Local search heuristics for the multidimensional assignment problem
- Assignment problems: a golden anniversary survey
- Selected topics on assignment problems
- Lower bounds for the axial three-index assignment problem
- An LP-based algorithm for the data association problem in multitarget tracking.
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- A hybrid genetic algorithm for the three-index assignment problem
- On solving a hard quadratic 3-dimensional assignment problem
- Asymptotic properties of random multidimensional assignment problems
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Time-cost tradeoff in a three-dimensional assignment problem
- Nonnegative tensors revisited: plane stochastic tensors
- Geometric three-dimensional assignment problems
- Approximation algorithms for multi-index transportation problems with decomposable costs
- Facets of the three-index assignment polytope
- A survey for the quadratic assignment problem
- A variation of the assignment problem
- The three-dimensional bottleneck assignment problem with capacity constraints
- Linear-time separation algorithms for the three-index assignment polytope
- Local search heuristics for the multidimensional assignment problem
- On a property of a three-dimensional matrix
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings
- Test problem generator for the multidimensional assignment problem
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Graph partitions for the multidimensional assignment problem
- On the number of local minima for the multidimensional assignment problem
- Efficient sensor network management for asset localization
- Random assignment problems
- Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- On multi-index assignment polytopes
- The three-dimensional assignment and partition problems. New lower bounds
- The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
- Integer programming models for the multidimensional assignment problem with star costs
- A bilinear programming formulation of the 3-dimensional assignment problem
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
- A survey of dynamic network flows
- Clique facets of the axial and planar assignment polytopes
- Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces
- Exact solution of emerging quadratic assignment problems
- The travelling salesman problem and a class of polyhedra of diameter two
- Branch and bound solution of the multidimensional assignment problem formulation of data association
- Random multi-index matching problems
- The multicommodity assignment problem: A network aggregation heuristic
- Solving the multidimensional assignment problem by a cross-entropy method
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies
- Multidimensional assignment problem for multipartite entity resolution
- Data-driven combinatorial optimization for sensor-based assessment of near falls
- Barycenters for the Hellinger-Kantorovich distance over \(\mathbb{R}^d\)
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
This page was built for publication: Letter to the Editor—The Multidimensional Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5549535)