Geometric three-dimensional assignment problems

DOI10.1016/0377-2217(95)00003-8zbMath0918.90124OpenAlexW2096497693MaRDI QIDQ1278259

Gerhard J. Woeginger, Frits C. R. Spieksma

Publication date: 27 April 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00003-8

zbMATH Keywords

computational complexitythree-dimensional assignment problems

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (15)

The approximability of three-dimensional assignment problems with bottleneck objective ⋮ The three-dimensional matching problem in kalmanson matrices ⋮ A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem ⋮ Between a rock and a hard place: the two-to-one assignment problem ⋮ Angle Optimization in Target Tracking ⋮ Dynamic discrete tomography ⋮ Geometric versions of the three-dimensional assignment problem under general norms ⋮ On a property of a three-dimensional matrix ⋮ Local search heuristics for the multidimensional assignment problem ⋮ On the computational complexity of finding a sparse Wasserstein barycenter ⋮ Combining solutions of the axial assignment problem ⋮ An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors ⋮ Multi-dimensional vector assignment problems ⋮ Randomized Approximation Algorithm for a Geometrical Multidimensional Assignment Problem ⋮ The focus of attention problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Throughput rate optimization in the automated assembly of printed circuit boards
• Rectilinear planar layouts and bipolar orientations of planar graphs
• A Monge property for the \(d\)-dimensional transportation problem
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Facets of the three-index assignment polytope
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
• Planar 3DM is NP-complete
• An Algorithm for the Three-Index Assignment Problem
• A bilinear programming formulation of the 3-dimensional assignment problem
• Letter to the Editor—The Multidimensional Assignment Problem

This page was built for publication: Geometric three-dimensional assignment problems