Geometric three-dimensional assignment problems
type: Item
instance of: scholarly article
title: Geometric three-dimensional assignment problems
zbMATH Open document ID: 0918.90124
DOI: 10.1016/0377-2217(95)00003-8
author: Frits C. R. Spieksma
author: Gerhard J. Woeginger
published in: European Journal of Operational Research
publication date: 1999-04-27T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 1252866
zbMATH Keywords: three-dimensional assignment problems
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00003-8
OpenAlex ID: W2096497693
cites work: Facets of the three-index assignment polytope
cites work: An Algorithm for the Three-Index Assignment Problem
cites work: A Monge property for the \(d\)-dimensional transportation problem
cites work: Q3880581
cites work: Three-dimensional axial assignment problems with decomposable cost coefficients
cites work: Throughput rate optimization in the automated assembly of printed circuit boards
cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities
cites work: Planar 3DM is NP-complete
cites work: A bilinear programming formulation of the 3-dimensional assignment problem
cites work: Q4198056
cites work: Q4065285
cites work: Q4142699
cites work: Letter to the Editor—The Multidimensional Assignment Problem
cites work: A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
cites work: Q4234156
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
description: scientific article; zbMATH DE number 1252866