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

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
- Discrete Applied Mathematics
- 2015

We investigate special cases of the quadratic assignment problem (QAP) where one of the two underlying matrices carries a simple… (More)

Is this relevant?

2012

2012

- Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger
- Oper. Res. Lett.
- 2012

We analyze a special case of the maximum quadratic assignment problem where one matrix is a monotone anti-Monge matrix and the… (More)

Is this relevant?

2012

2012

- Haim Kaplan, Shay Mozes, Yahav Nussbaum, Micha Sharir
- SODA
- 2012

We describe a data structure for submatrix maximum queries in Monge matrices or Monge partial matrices, where a query specifies a… (More)

Is this relevant?

2005

2005

- Wolfgang W. Bein, Peter Brucker, Lawrence L. Larmore, James K. Park
- Discrete Applied Mathematics
- 2005

We give algorithmic results for combinatorial problems with cost arrays possessing certain algebraic Monge properties. We extend… (More)

Is this relevant?

1998

1998

- Dominique Fortin, Rüdiger Rudolf
- Discrete Mathematics
- 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

- Rainer E. Burkard, Vladimir G. Deineko
- Inf. Process. Lett.
- 1998

We show that the traveling salesman problem with a symmetric relaxed Monge matrix as distance matrix is pyramidally solvable and… (More)

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)

Is this relevant?

1995

1995

- DISKRETE OPTIMIERUNG, Rainer E. Burkard, Gerhard J. Woeginger
- 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

- James K. Park
- 1991

This thesis develops a body of versatile algorithmic techniques. We demonstrate the power and generality of these techniques by… (More)

Is this relevant?