Abstract
In recent years there has been a growing interest in discrete optimization problems satisfying the “Monge”-property or related properties. In this survey some of the recent results on this topic will be presented.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, M.M. Klawe, S. Moran, P. Shor, and R. Wilber. Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195–208, 1987.
A. Aggarwal and J.K. Park. Notes on searching in multidimensional monotone arrays. In Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 497–512, 1988.
A. Aggarwal and J.K. Park. Sequential searching in multidimensional monotone arrays. Research Report R.C. 15128, IBM T.J. Watson Research Center, November 1989.
A. Aggarwal and J.K. Park. Inproved algorithms for economic lot-size problems. Operations Research, 1991. To appear.
S. Albers and P. Brucker. The complexity of one-machine batching problems. To appear in Discrete Applied Mathematics. 1991.
N. Alon, S. Cosares, D.S. Hochbaum and R. Shamir. An algorithm for the detection and construction of Monge sequences. Linear Algebra and Its Applications, 114/115, 669–680, 1989.
W.W. Bein, P. Brucker, and P.K. Parthak. Monge properties in higher dimensions. Technical Report CS 90–11, University of New Mexico, October 1990.
P. Brucker. Efficient algorithms for some path partitioning problems. Osnabrücker Schriften zur Mathematik, Reihe P, Heft 142, 1991
R.E. Burkard and J.A.A. van der Veen. Universal conditions for algebraic traveling salesman problems to be efficiently solvable. Report Nr. 163, Institut für Mathematik, Technische Universität Graz, 1990.
K Cechlárová and P Szabó. On the Monge property of matrices. Discrete Mathematics, 81, 123–128, 1990.
Z. Galil and K. Park. A linear-time algorithm for concave one-dimensional dynamic programming. Information Processing Letters, 33, 309–311, 1990.
D.S. Hirschberg and L.L. Larmore. The least weight subsequence problem. SIAM Journal on Computing, 16, 628–638, 1987.
M.M. Klawe. A simple linear time algorithm for concave one-dimensional dynamic programming. Technical Report 89–16, University of British Columbia, 1989.
L.L. Larmore and B. Schieber. On-line dynamic programming with applications to the prediction of RNA secondary structure. Journal of Algorithms, 1991. To appear.
J.K. Park. The Monge array: an abstraction and its applications. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Physica-Verlag Heidelberg
About this paper
Cite this paper
Brucker, P. (1992). “Monge”-property and efficient algorithms. In: Gritzmann, P., Hettich, R., Horst, R., Sachs, E. (eds) Operations Research ’91. Physica-Verlag HD. https://doi.org/10.1007/978-3-642-48417-9_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-48417-9_40
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-0608-3
Online ISBN: 978-3-642-48417-9
eBook Packages: Springer Book Archive