On Monge Sequences in D-dimensional Arrays on Monge Sequences in D-dimensional Arrays

  title={On Monge Sequences in D-dimensional Arrays on Monge Sequences in D-dimensional Arrays},
  author={R Udiger Rudolf},
  • R Udiger Rudolf
  • Published 1993
Let C be an n m matrix. Then the sequence S := j nm)) of pairs of indices is called a Monge sequence with respect to the given matrix C if and only if, whenever (i; j) precedes both (i; s) and (r; j) in S then ci; j] + cr; s] ci; s] + cr; j]. Monge sequences play an important role in greedily solvable transportation problems. Hooman showed that the greedy algorithm which maximizes all variables along a sequence S in turn solves the classical Hitchcock transportation problem for all supply and… CONTINUE READING

From This Paper

Topics from this paper.


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 11 references

Antimatroids and the Transportation Problem with Forbidden Arcs

L Dietrich, Monge Sequences
Linear Algebra and its Applications • 1990

An Algorithm for the Detection and Construction of Monge Sequences

N Alon, S Cosares, D S Hochbaum, R Shamir
Linear Algebra and its Applications • 1989

Applications of a size reduction technique for transportation problems in sampling

M Fahmi, P K Pathak
Proceedings of the First International Symposium on Optimization and Statistics • 1989

On simple linear programming problems

J Hooman
Convexity, Proc. Symposia in Pure Mathematics • 1961

Academie des Sciences

G Monge, D Eblai Et Remblai, M De
Academie des Sciences

Similar Papers

Loading similar papers…