An augmenting path method for solving Linear Bottleneck Assignment problems

U. Derigs; U. Zimmermann

doi:10.1007/bf02252026

journal article Dec 01, 1978

An augmenting path method for solving Linear Bottleneck Assignment problems

U. Derigs U. Zimmermann

Computing Vol. 19 No. 4 pp. 285-295 · Springer Science and Business Media LLC

View at Publisher Save 10.1007/bf02252026

Topics

No keywords indexed for this article. Browse by subject →

References

21

[1]

Burkard, R. E.: Numerische Erfahrungen mit Summen- und Bottleneck-Zuordnungsproblemen, in: Numerische Methoden bei graphentheoretischen und kombinatorischen Problemen (Collatz L., Werner H., eds.), pp. 9–25. (ISNM, Vol. 29.) Basel-Stuttgart: Birkhäuser 1975.

[2]

Burkard, R. E., Hahn, W., Zimmermann, U.: An Algebraic Approach to Assignment Problems. Math. Prog.12, 318–327 (1977). 10.1007/bf01593800

[3]

Burkard, R. E., Zimmermann, U.: Weakly Admissible Transformations. Report Nr. 77-3. Mathematisches Institut, Universität zu Köln, Köln, 1977.

[4]

A note on two problems in connexion with graphs

E. W. Dijkstra

Numerische Mathematik 1959 10.1007/bf01386390

[5]

Dorhout, B.: Het Lineaire Toewijzungsproblem, Vergelijken van Algorithmen. Report BN 21/73 Stichting Mathematisch Centrum, Amsterdam, 1973.

[6]

Edmonds, J., Fulkerson, R.: Bottleneck Extrema. J. Comb. Theory8, 299–306 (1970). 10.1016/s0021-9800(70)80083-7

[7]

Esser, R., Meis, T.: Sortieren und Suchen. Vorlesungsskriptum, Mathematisches Institut, Universität zu Köln, Köln, 1977.

[8]

Fulkerson, R., Glicksberg, I., Gross, O.: A Production Line Assignment Problem. RAND Res. Mem. RM-1102 (1953).

[9]

Garfinkel, R.: An Improved Algorithm for the Bottleneck Assignment Problem. Op. Res.19, 1747–1751 (1971). 10.1287/opre.19.7.1747

[10]

Greenwood, J. A.: A Fast Machine-Independent Long-Periodical Generator for 31-Bit Pseudo-Random Integers. From Compstat 1976, Proceedings in Computational Statistics, Wien: 1976.

[11]

Gross, O.: The Bottleneck Assignment Problem. Report P-1630, RAND Corp. (1959).

[12]

Hammer, P. L.: Time Minimizing Transportation Problems. Nav. Res. Log. Quart.16, 345–367 (1969);18, 487–490 (1971). 10.1002/nav.3800160307

[13]

Herrmann, H.: Anwendung der Ungarischen Methode auf die Lösung von Engpaß-Zuordnungsproblemen. (Unpublished.) Inst. für Rechentechnik, TU Braunschweig (1967).

[14]

Hoare, C. A. R.: Quicksort. Comp. Journal5, 10–15 (1962). 10.1093/comjnl/5.1.10

[15]

The Hungarian method for the assignment problem

H. W. Kuhn

Naval Research Logistics Quarterly 1955 10.1002/nav.3800020109

[16]

Page, E. S.: A Note on Assignment Problems. Comp. Journal6, 241–243 (1963). 10.1093/comjnl/6.3.241

[17]

Pape, U., Schön, B.: Verfahren zur Lösung von Summen- und Engpaß-Zuordnungsproblemen. Elektronische Datenverarbeitung4, 149–163 (1970).

[18]

Srinivasan, V., Thompson, G. L.: Algorithms for Minimizing Total Cost, Bottleneck Time and Bottleneck Shipment in Transportation Problems. Nav. Res. Log. Quart.23, 567–595 (1976). 10.1002/nav.3800230402

[19]

Swarcz, N.: Some Remarks on the Time Transporation Problem. Nav. Res. Log. Quart.18, 473–484 (1971). 10.1002/nav.3800180405

[20]

Tomizawa, N.: On Some Techniques Useful for Solution of Transportation Network Problems. Networks1, 179–194 (1972).

[21]

Zimmermann, U.: Boolesche Optimierungsprobleme mit separabler Zielfunktion und matroidalen Restriktionen. Thesis, Universität zu Köln, Köln, 1976.

Metrics

44

Citations

21

References

Details

Published: Dec 01, 1978
Vol/Issue: 19(4)
Pages: 285-295
License: View

Authors

Cite This Article

U. Derigs, U. Zimmermann (1978). An augmenting path method for solving Linear Bottleneck Assignment problems. Computing, 19(4), 285-295. https://doi.org/10.1007/bf02252026

An augmenting path method for solving Linear Bottleneck Assignment problems

You May Also Like