Monge array

Known as: Monge matrix 
In mathematics applied to computer science, Monge arrays, or Monge matrices, are mathematical objects named for their discoverer, the French… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2016
02419912016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2012
2012
We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the… (More)
  • figure 1
Is this relevant?
2012
2012
We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
2005
2005
We give algorithmic results for combinatorial problems with cost arrays possessing certain algebraic Monge properties. We extend… (More)
Is this relevant?
1998
1998
An n x n matrix C is called a weak Mange matrix if cii + c,~ GIs + cti for all 1 < i < r, s 6 n. It is well known that the… (More)
Is this relevant?
1998
1998
We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and… (More)
  • figure 1
  • figure 2
Is this relevant?
1996
1996
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coefficient matrices is… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1995
1995
This paper investigates a restricted version of the Quadratic Assignment Problem (QAP), where one of the coeecient matrices is an… (More)
Is this relevant?
1993
1993
An II x m matrix A is called bottleneck Monge matrix if max{ajj, a,,} < max{a,, ali} for all l<i<r<n, 1 < j < s < m. The matrix A… (More)
Is this relevant?
1991
1991
This thesis develops a body of versatile algorithmic techniques. We demonstrate the power and generality of these techniques by… (More)
Is this relevant?