Approximation algorithms for three-dimensional assignment problems with triangle inequalities
From MaRDI portal
Recommendations
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- The approximability of three-dimensional assignment problems with bottleneck objective
- scientific article; zbMATH DE number 1202983
- Geometric three-dimensional assignment problems
- Geometric versions of the three-dimensional assignment problem under general norms
Cites work
- scientific article; zbMATH DE number 3482073 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A bilinear programming formulation of the 3-dimensional assignment problem
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- Facets of the three-index assignment polytope
- Throughput rate optimization in the automated assembly of printed circuit boards
Cited in
(42)- Three-index linear programs with nested structure
- The focus of attention problem
- A Simultaneous Magnanti-Wong Method to Accelerate Benders Decomposition for the Metropolitan Container Transportation Problem
- Scheduling sports competitions on multiple venues.
- Local search heuristics for the multidimensional assignment problem
- Solution approaches to the three-index assignment problem
- Lower bounds for the axial three-index assignment problem
- The approximability of three-dimensional assignment problems with bottleneck objective
- A hybrid genetic algorithm for the three-index assignment problem
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- A heuristic method for solving integer-valued decompositional multiindex problems
- Multi-index transport problems with decomposition structure
- Geometric three-dimensional assignment problems
- Approximation algorithms for multi-index transportation problems with decomposable costs
- Between a rock and a hard place: the two-to-one assignment problem
- Multi-dimensional vector assignment problems
- A survey for the quadratic assignment problem
- Between a rock and a hard place: the two-to-one assignment problem
- Local search heuristics for the multidimensional assignment problem
- On a property of a three-dimensional matrix
- Test problem generator for the multidimensional assignment problem
- Three-dimensional axial assignment problems with decomposable cost coefficients
- approxmatch
- Integer programming models for the multidimensional assignment problem with star costs
- Combining solutions of the axial assignment problem
- Heuristic strategies for combining solutions of the three-index axial assignment problem
- Approximate search for known gene clusters in new genomes using PQ-trees
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
- Fast separation for the three-index assignment problem
- On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
- The three-dimensional matching problem in kalmanson matrices
- Scheduling jobs of equal length: Complexity, facets and computational results
- Branch and bound solution of the multidimensional assignment problem formulation of data association
- The three dimensional bottleneck assignment problem and its variants
- Geometric versions of the three-dimensional assignment problem under general norms
- Using Approximation Algorithms to Build Evidence Factors and Related Designs for Observational Studies
- Dynamic discrete tomography
- A new design for observational studies applied to the study of the effects of high school football on cognition late in life
- Multiindex transportation problems with 2-embedded structure
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- Efficient algorithms for three‐dimensional axial and planar random assignment problems
This page was built for publication: Approximation algorithms for three-dimensional assignment problems with triangle inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q139206)
