Approximation algorithms for three-dimensional assignment problems with triangle inequalities (Q139206): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||||||||||||||
(6 intermediate revisions by 5 users not shown) | |||||||||||||||
Property / publication date | |||||||||||||||
16 January 1993
| |||||||||||||||
Property / publication date: 16 January 1993 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Frits C. R. Spieksma / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / author | |||||||||||||||
Property / author: Yves Cramer / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / title | |||||||||||||||
Approximation algorithms for three-dimensional assignment problems with triangle inequalities (English) | |||||||||||||||
Property / title: Approximation algorithms for three-dimensional assignment problems with triangle inequalities (English) / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Open document ID | |||||||||||||||
Property / zbMATH Open document ID: 0761.90071 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / review text | |||||||||||||||
The three-dimensional assignment problem (3DA) is defined as follows. Given are three disjoint \(n\)-sets of points, and nonnegative costs associated with each triangle consisting of exactly one point from each set. The problem is to find a minimum-weight collection of a triangles covering each point exactly once. We consider the special cases of 3DA where a distance (verifying the triangle inequalities) is defined on the set of points, and the cost of a triangle is either the sum of the lengths of its sides (problem \(T\Delta\)) or the sum of the lengths of its two shortest sides (problem \(S\Delta\)). We prove that \(T\Delta\) and \(S\Delta\) are NP-hard. For both \(T\Delta\) and \(S\Delta\), we present 1/2- and 1/3-approximate algorithms, i.e. heuristics which always deliver a feasible solution whose cost is at most 3/2, resp. 4/3, of the optimal cost. Computational experiments indicate that the performance of these heuristics is excellent on randomly generated instances of \(T\Delta\) and \(S\Delta\). Extensions of the previous results to the \(k\)-dimensional case \((k\geq 3)\) were obtained by \textit{H.-J. Bandelt, Y. Crama} and \textit{F. C. Spieksma}, ``Approximation algorithms for multidimensional assignment problems with decomposable costs'' [to appear in Discrete Appl. Math.]. | |||||||||||||||
Property / review text: The three-dimensional assignment problem (3DA) is defined as follows. Given are three disjoint \(n\)-sets of points, and nonnegative costs associated with each triangle consisting of exactly one point from each set. The problem is to find a minimum-weight collection of a triangles covering each point exactly once. We consider the special cases of 3DA where a distance (verifying the triangle inequalities) is defined on the set of points, and the cost of a triangle is either the sum of the lengths of its sides (problem \(T\Delta\)) or the sum of the lengths of its two shortest sides (problem \(S\Delta\)). We prove that \(T\Delta\) and \(S\Delta\) are NP-hard. For both \(T\Delta\) and \(S\Delta\), we present 1/2- and 1/3-approximate algorithms, i.e. heuristics which always deliver a feasible solution whose cost is at most 3/2, resp. 4/3, of the optimal cost. Computational experiments indicate that the performance of these heuristics is excellent on randomly generated instances of \(T\Delta\) and \(S\Delta\). Extensions of the previous results to the \(k\)-dimensional case \((k\geq 3)\) were obtained by \textit{H.-J. Bandelt, Y. Crama} and \textit{F. C. Spieksma}, ``Approximation algorithms for multidimensional assignment problems with decomposable costs'' [to appear in Discrete Appl. Math.]. / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 90C10 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 90C35 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 90C60 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Mathematics Subject Classification ID | |||||||||||||||
Property / Mathematics Subject Classification ID: 90-08 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH DE Number | |||||||||||||||
Property / zbMATH DE Number: 94374 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
computational analysis | |||||||||||||||
Property / zbMATH Keywords: computational analysis / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
three-dimensional assignment | |||||||||||||||
Property / zbMATH Keywords: three-dimensional assignment / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / zbMATH Keywords | |||||||||||||||
heuristics | |||||||||||||||
Property / zbMATH Keywords: heuristics / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / MaRDI profile type | |||||||||||||||
Property / MaRDI profile type: MaRDI publication profile / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Facets of the three-index assignment polytope / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Throughput rate optimization in the automated assembly of printed circuit boards / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: A bilinear programming formulation of the 3-dimensional assignment problem / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4198056 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4065285 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / cites work | |||||||||||||||
Property / cites work: Q4739657 / rank | |||||||||||||||
Normal rank | |||||||||||||||
links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 16:17, 16 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximation algorithms for three-dimensional assignment problems with triangle inequalities |
scientific article |
Statements
60
0 references
3
0 references
273-279
0 references
August 1992
0 references
16 January 1993
0 references
Approximation algorithms for three-dimensional assignment problems with triangle inequalities (English)
0 references
The three-dimensional assignment problem (3DA) is defined as follows. Given are three disjoint \(n\)-sets of points, and nonnegative costs associated with each triangle consisting of exactly one point from each set. The problem is to find a minimum-weight collection of a triangles covering each point exactly once. We consider the special cases of 3DA where a distance (verifying the triangle inequalities) is defined on the set of points, and the cost of a triangle is either the sum of the lengths of its sides (problem \(T\Delta\)) or the sum of the lengths of its two shortest sides (problem \(S\Delta\)). We prove that \(T\Delta\) and \(S\Delta\) are NP-hard. For both \(T\Delta\) and \(S\Delta\), we present 1/2- and 1/3-approximate algorithms, i.e. heuristics which always deliver a feasible solution whose cost is at most 3/2, resp. 4/3, of the optimal cost. Computational experiments indicate that the performance of these heuristics is excellent on randomly generated instances of \(T\Delta\) and \(S\Delta\). Extensions of the previous results to the \(k\)-dimensional case \((k\geq 3)\) were obtained by \textit{H.-J. Bandelt, Y. Crama} and \textit{F. C. Spieksma}, ``Approximation algorithms for multidimensional assignment problems with decomposable costs'' [to appear in Discrete Appl. Math.].
0 references
computational analysis
0 references
three-dimensional assignment
0 references
heuristics
0 references
0 references