Three-dimensional axial assignment problems with decomposable cost coefficients
From MaRDI portal
Recommendations
- Geometric versions of the three-dimensional assignment problem under general norms
- scientific article; zbMATH DE number 2097292
- Efficient algorithms for three‐dimensional axial and planar random assignment problems
- scientific article; zbMATH DE number 1894378
- scientific article; zbMATH DE number 151870
Cites work
- scientific article; zbMATH DE number 3685223 (Why is no real title available?)
- scientific article; zbMATH DE number 151870 (Why is no real title available?)
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3482073 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A Monge property for the \(d\)-dimensional transportation problem
- An Algorithm for the Three-Index Assignment Problem
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Letter to the Editor—The Multidimensional Assignment Problem
- Time bounds for selection
Cited in
(35)- The focus of attention problem
- Monge properties, discrete convexity and applications
- Scheduling sports competitions on multiple venues.
- A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem
- Selected topics on assignment problems
- Lower bounds for the axial three-index assignment problem
- A hybrid genetic algorithm for the three-index assignment problem
- Extremal circular permutations with concave functions
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
- Multi-index transport problems with decomposition structure
- Geometric three-dimensional assignment problems
- 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
- Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial 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
- Treatment of combinatorial optimization problems using selection equations with cost terms. II: NP-hard three-dimensional assignment problems
- Efficient sensor network management for asset localization
- scientific article; zbMATH DE number 4145659 (Why is no real title available?)
- The assignment problem with nearly Monge arrays and incompatible partner indices
- On multi-index assignment polytopes
- Replication and sequencing of unreliable jobs on parallel machines
- Integer programming models for the multidimensional assignment problem with star costs
- Combining solutions of the axial assignment problem
- Optimal power control in OFDMA cellular networks
- Perspectives of Monge properties in optimization
- Clique facets of the axial and planar assignment polytopes
- Criteria convolutions when combining the solutions of the multicriteria axial assignment problem
- Fast separation for the three-index assignment problem
- On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies
- Geometric versions of the three-dimensional assignment problem under general norms
- An adaptive algorithm for solving the axial three-index assignment problem
- Efficient algorithms for three‐dimensional axial and planar random assignment problems
This page was built for publication: Three-dimensional axial assignment problems with decomposable cost coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917264)
