Geometric three-dimensional assignment problems
From MaRDI portal
Recommendations
- Geometric versions of the three-dimensional assignment problem under general norms
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- The approximability of three-dimensional assignment problems with bottleneck objective
- scientific article; zbMATH DE number 1202983
Cites work
- scientific article; zbMATH DE number 3685223 (Why is no real title available?)
- scientific article; zbMATH DE number 3482073 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1263283 (Why is no real title available?)
- A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
- A Monge property for the \(d\)-dimensional transportation problem
- A bilinear programming formulation of the 3-dimensional assignment problem
- An Algorithm for the Three-Index Assignment Problem
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Facets of the three-index assignment polytope
- Letter to the Editor—The Multidimensional Assignment Problem
- Planar 3DM is NP-complete
- Rectilinear planar layouts and bipolar orientations of planar graphs
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Throughput rate optimization in the automated assembly of printed circuit boards
Cited in
(19)- Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem
- On computing a center persistence diagram
- Combining solutions of the axial assignment problem
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Multi-dimensional vector assignment problems
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
- Between a rock and a hard place: the two-to-one assignment problem
- The three-dimensional matching problem in kalmanson matrices
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Dynamic discrete tomography
- Angle Optimization in Target Tracking
- On resource placements in 3D tori.
- Geometric versions of the three-dimensional assignment problem under general norms
- The approximability of three-dimensional assignment problems with bottleneck objective
- On the computational complexity of finding a sparse Wasserstein barycenter
- Local search heuristics for the multidimensional assignment problem
- The focus of attention problem
- On a property of a three-dimensional matrix
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
This page was built for publication: Geometric three-dimensional assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278259)