The approximability of three-dimensional assignment problems with bottleneck objective (Q845547): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11590-009-0152-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2153180732
@@ Property / OpenAlex ID: W2153180732 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for three-dimensional assignment problems with triangle inequalities
+Normal rank
@@ Property / cites work @@
+Q3154375
@@ Property / cites work: Q3154375 / rank @@
+Normal rank
@@ Property / cites work @@
+Planar 3DM is NP-complete
@@ Property / cites work: Planar 3DM is NP-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Clustering to minimize the maximum intercluster distance
+Normal rank
@@ Property / cites work @@
+The three dimensional bottleneck assignment problem and its variants
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for multi-index transportation problems with decomposable costs
+Normal rank
@@ Property / cites work @@
+Geometric three-dimensional assignment problems
@@ Property / cites work: Geometric three-dimensional assignment problems / rank @@
+Normal rank
@@ Property / cites work @@
+Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
+Normal rank
@@ Property / cites work @@
+Approximations for a bottleneck Steiner tree problem
+Normal rank