A general class of greedily solvable linear programs

Mathematics of Operations Research

Volumn 23, Issue 4, 1998, Pages 892-908

  Queyranne, Maurice ^a   Spieksma, Frits ^b   Tardella, Fabio ^c  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b MAASTRICHT UNIVERSITY   (Netherlands)

^c SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

Greedy algorithms; Lattices; Monge property; Multi index transportation problems; Polymatroids; Submodular functions; Submodular systems

Indexed keywords

ALGORITHMS; COSTS; FUNCTIONS; MATHEMATICAL MODELS; PROBLEM SOLVING;

FINITE PRODUCT LATTICES; GREEDY ALGORITHMS; SUBMODULAR COSTS;

LINEAR PROGRAMMING;

EID: 0032207260     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.4.892     Document Type: Article

References (50)

1. Adler, I., A. J. Hoffman, R. Shamir. 1993. Monge and feasibility sequences in general flow problems. Discrete Appl. Math. 44 21-38.
2. _, R. Shamir. 1993. Greedily solvable transportation networks and edge-guided vertex elimination. D.-Z. Du, P. M. Pardalos, eds. Network Optimization Problems: Algorithms, Applications and Complexity. World Scientific, 1-22.
3. Aggarwal, A., M. M. Klawe. 1990. Applications of generalized matrix searching to geometric algorithms. Discrete Appl. math. 27 3-23.
4. _, _, S. Moran, P. Shor, R. Wilber. 1987. Geometric applications of a matrix-searching algorithm. Algorithmica 2 195-208.
5. _, J. K. Park. 1989a. Sequential searching in multi-dimensional monotone arrays. Research Report RC 15128, IBM T. J. Watson Research Center, Yorktown Heights.
6. _, _. 1989b. Parallel searching in multi-dimensional monotone arrays. Research Report RC 14826, IBM T. J. Watson Research Center, Yorktown Heights.
7. _, _. 1993. Improved algorithms for economic lot-size problems. Oper. Res. 41 549-571.
8. Balas, E., M. J Saltzman. 1989. Facets of the three-index assignment polytope. Discrete Appl. Math. 23 201-229.
9. Bandelt, H. J., Y. Crama, F. C. R. Spieksma. 1994. Approximation algorithms for multi-dimensional assignment problems with decomposable costs. Discrete Appl. Math. 49 25-50.
10. Bein, W. W., P. Brucker, P. K. Pathak. 1991. Monge properties in higher dimensions. Preprint 134, Universität Osnabrück.
11. _, _, J. K. Park, P. K. Pathak. 1995. A Monge property for the d-dimensional transportation problem. Discrete Appl. Math. 58 97-109.
12. Birkhoff, G. 1967. Lattice Theory, 3rd ed. Amer. Math. Soc. Colloq. Publ. Vol 25, American Mathematical Society, Providence, RI.
13. Burkard, R. E., B. Klinz, R. Rudolf. 1996. Perspectives of Monge properties in optimization. Discrete Appl. Math. 70 95-161.
14. Crama, Y., F. C. R. Spieksma. 1992. Approximation algorithms for three-dimensional assignment problems with triangle inequalities. European J. Operational Res. 60 273-279.
15. Dietrich, B. L. 1990. Monge sequences, antimatroids, and the transportation problem with forbidden arcs. Linear Algebra Appl. 39 133-145.
16. Edmonds, J. 1970. Submodular functions, matroids and certain polyhedra. R. Guy et al., eds. Combinatorial Structures and Their Applications. Gordon and Breach, New York, 69-87.
17. _. 1971. Matroids and the greedy algorithm. Math. Programming 1 127-136.
18. _, R. Giles, 1974. A min-max relation for submodular functions on graphs. Ann. Discrete Math. 1 185-204.
19. Faigle, U., W. Kern. 1996. Submodular linear programs on forests. Math. Programming 72 195-206. (Original manuscript: Memorandum No. 1163, Faculty of Applied Mathematics, University of Twente, September 1993.)
20. Frank, A., É. Tardos. 1988. Generalized polymatroids and submodular flows. Math. Programming 42 489-563.
21. Frieze, A. M., J. Yadegar. 1981. An algorithm for solving 3-dimensional assignment problems with applications to scheduling a teaching practice. J. Operational Res. Soc. 32 989-995.
22. Fujisfaige, S. 1991. Submodular Functions and Optimization . North-Holland, Amsterdam.
23. _, N. Tomizawa. 1983. A note on submodular functions on distributive lattices. J. Oper. Res. Soc. Japan 26 309-318.
24. Gilmore, P. C., E. L. Lawler, D. B. Shmoys. 1985. Well-solved special cases. E. L. Lawler et al., eds. The Traveling Salesman Problem. Wiley, Chichester.
25. Granot, F., A. F. Veinott, Jr. 1985. Substitutes, complements and ripples in network flows. Math. Oper. Res. 10 471-497.
26. Haley, K. B. 1962. The multi-index problem. Oper. Res. 11 368-379.
27. Hoffman, A. J. 1963. On simple linear programming problems. V. Klee, ed. Convexity: Proceedings of the Seventh Symposium in Pure Mathematics, Proceedings of Symposia in Pure Mathematics, Vol. 7. American Mathematical Society, Providence, RI, 317-327.
28. _. 1974. A generalization of max-flow min-cut. Math . Programming 6 352-359.
29. _. 1985. On greedy algorithms that succeed. I. Anderson, ed. Surveys in Combinatorics. Cambridge University Press, Cambridge, 97-112.
30. Klawe, M. M. 1992. Superlinear bounds for matrix searching problems. J. Algorithms 13 55-78.
31. Korte, B., L. Lovász, R. Schrader. 1991. Greedoids. Springer, Berlin.
32. Korsnikov, A. D. 1988. Planar three-index transportation problems with dominating index. Z OR - Zeitschrift für Oper. Res. 32 29-33.
33. Larmore, L. L , B. Schieber 1991. On-line dynamic programming with applications to the prediction of RNA secondary structure. J. Algorithms 12 490-515
34. Lovász, L. 1983. Submodular functions and convexity. A. Bachem et al., eds. Mathematical Programming - The State of The Art. Springer, Berlin, 235-257.
35. Monge, G. 1781. Mémoire sur la théorie des déblais et remblais. Mémoires de Mathematiques et de Physique, 666-704.
36. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, Chichester.
37. Park, J. K. 1991. A special case of the n-vertex traveling salesman problem that can be solved in O(n) time. Information Processing Letters 40 247-254.
38. Pierskalla, W. P. 1968. The multidimensional assignment problem. Oper. Res. 16 422-431.
39. Queyranne, M., F. C. R. Spieksma. 1997. Approximation algorithms for multi-index transportation problems with decomposable costs. Discrete Appl. Math. 76 239-253.
40. _, _, F. Tardella. 1993. A general class of greedily solvable linear programs. G. Rinaldi and L. Wolsey, eds. Integer Programming and Combinatorial Optimization 3, Proceedings of the Third IPCO Conference, CORE, Louvain-la-Neuve, May 1993, 385-399.
41. Rudolf, R. 1992. Personal communication.
42. Sankoff, D., J. B. Kruskal, eds. 1983. Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison. Addison-Wesley, Reading, MA.
43. Shamir, R., B. L. Dietrich. 1990. Characterization and algorithms for greedily solvable transportation problems. Proc. 1st ACM/SIAM Symposium on Discrete Algorithms, 358-366.
44. Tamir, A. 1993. The least element property of center location on tree networks with applications to distance and precedence constrained problems. Math. Programming 62 475-496.
45. Topkis, D. M. 1978. Minimizing a submodular function on a lattice. Oper. Res. 26 305-321.
46. van der Veen, J. A., R. van Dal. 1991. Solvable cases of the no-wait flow-shop scheduling problem. J. Operational Res Soc. 42 971-980.
47. Veinott, A. F., Jr. 1989. Representation of general and polyhedral subsemilattices and sublattices of product spaces. Linear Algebra Appl. 114/115 681-704.
48. Wu, X. 1991. Optimal quantization by matrix searching. J. Algorithms 12 663-673.
49. Yao, F. F. 1980. Efficient dynamic programming using quadrangle inequalities. Proc. 12th ACM Symposium on Theory of Computing, 429-435.
50. Yemelichev, V. A., M. M. Kovalev, M. K. Kratsov. 1984. Polytopes, Graphs and Optimisation. Cambridge University Press, Cambridge.