The constant objective value property for multidimensional assignment problems

DOI10.1016/j.disopt.2016.01.004zbMath1387.90211OpenAlexW2272041761MaRDI QIDQ1751146

Bettina Klinz, Ante Ćustić

Publication date: 24 May 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2016.01.004

zbMATH Keywords

multidimensional assignment problemadmissible transformationconstant objective valuesum-decomposable array

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

The bilinear assignment problem: complexity and polynomially solvable special cases ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linearizable special cases of the QAP
• Admissible transformations and assignment problems
• A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
• Complexity of a 3-dimensional assignment problem
• On multi-index assignment polytopes
• An O(n⁴) Algorithm for the QAP Linearization Problem
• Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
• Assignment Problems
• Reducibility among Combinatorial Problems
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• A Combinatorial Theorem with an Application to Latin Rectangles

This page was built for publication: The constant objective value property for multidimensional assignment problems