Three-dimensional axial assignment problems with decomposable cost coefficients
From MaRDI portal
Publication:1917264
DOI10.1016/0166-218X(95)00031-LzbMath0846.90090MaRDI QIDQ1917264
Rüdiger Rudolf, Gerhard J. Woeginger, Rainer E. Burkard
Publication date: 3 October 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items
A hybrid genetic algorithm for the three-index assignment problem, A survey for the quadratic assignment problem, The assignment problem with nearly Monge arrays and incompatible partner indices, Efficient sensor network management for asset localization, Fast separation for the three-index assignment problem, Perspectives of Monge properties in optimization, Replication and sequencing of unreliable jobs on parallel machines, Between a rock and a hard place: the two-to-one assignment problem, On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies, Monge properties, discrete convexity and applications, Optimal power control in OFDMA cellular networks, Geometric versions of the three-dimensional assignment problem under general norms, On a property of a three-dimensional matrix, Characterization of the types of maximum noninteger vertices in the relaxation polyhedron of the four-index axial assignment problem, Integer programming models for the multidimensional assignment problem with star costs, Selected topics on assignment problems, Local search heuristics for the multidimensional assignment problem, Multi-index transport problems with decomposition structure, On multi-index assignment polytopes, Test problem generator for the multidimensional assignment problem, An adaptive algorithm for solving the axial three-index assignment problem, Combining solutions of the axial assignment problem, Scheduling sports competitions on multiple venues., An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors, Geometric three-dimensional assignment problems, Clique facets of the axial and planar assignment polytopes, Lower bounds for the axial three-index assignment problem, Multi-dimensional vector assignment problems, The focus of attention problem
Cites Work
- Approximation algorithms for three-dimensional assignment problems with triangle inequalities
- Time bounds for selection
- A Monge property for the \(d\)-dimensional transportation problem
- An Algorithm for the Three-Index Assignment Problem
- Letter to the Editor—The Multidimensional Assignment Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
