HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Weak Algebraic Monge Arrays

Abstract : An $n\times n$ matrix $C$ is called a {\em weak Monge\/} matrix iff $c_{ii}+c_{rs}\le c_{is}+c_{ri}$ for all $1\le i\le r,s\le n$. It is well known that the classical linear assignment problem is optimally solved by the identity permutation if the underlying cost-matrix fulfills the weak Monge property. In this paper we introduce higher dimensional weak Monge arrays and prove that higher dimensional axial assignment problems can be solved efficiently if the cost-structure is a higher dimensional weak Monge array. Additionally, the concept of weak Monge arrays is related to other Monge properties and extended in an algebraic framework. Finally, the problem of testing whether or not a given array can be permuted to become a weak Monge array is solved.
Document type :
Complete list of metadata

Cited literature [2 references]  Display  Hide  Download

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 2:40:54 PM
Last modification on : Friday, February 4, 2022 - 3:16:37 AM
Long-term archiving on: : Tuesday, April 12, 2011 - 3:41:41 PM


  • HAL Id : inria-00074176, version 1



Rüdiger Rudolf, Dominique Fortin. Weak Algebraic Monge Arrays. [Research Report] RR-2501, INRIA. 1995. ⟨inria-00074176⟩



Record views


Files downloads