Skip to main content
SpringerLink
Log in

Parallele Lösung eines Verschnittproblems

  • Conference paper
Parallele Datenverarbeitung mit dem Transputer

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 237))

  • 47 Accesses

Zusammenfassung

Eine klassische Methode zur Lösung von Optimierungs-Problemen ist das Branch-&-Bound Verfahren. Zur Reduzierung der Laufzeit, die von einem solchen, sequentiellen Algorithmus benötigt wird, kann man ein Prozessor Netzwerk einsetzen und alle anfallenden Berechnungen möglichst gleichmäßig auf diese Prozessoren verteilen.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 44.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. P. De Cani: Packing Problems in Theory and Practice, Ph. D. Thesis, University of Birmingham, Department of Engineering Production, März 1979

    Google Scholar 

  2. E.W, Dijkstra, W.H.J. Feijen, A.J.M. van Gasteren: Derivation of a termination detection algorithm for distributed computations, Inf. Proc. Letters 16 (1983), pp. 217–219

    Article  Google Scholar 

  3. M.R. Gamy, D.S. Johnson: Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, California

    Google Scholar 

  4. J.C. Herz: Recursice Computational Procedure for Two-dimensional Stock Cutting, in: IBM J. Res. Develop. 16 (1972) 5, pp. 462–469

    Google Scholar 

  5. B. Kröger, O. Vornberger: Solving Combinatorial Problems on a Transputer Network, eingeladener Vortrag zum Workshop on Parallel Computing in Practice, gefödert durch das Leibnitz Center for Research in Computer Science, Jerusalem, 20–23 Mai, 1989

    Google Scholar 

  6. T.H. Lai, S. S.hni: Anomalies in Parallel Branch-and-Bound Algorithms, Communications of the ACM, Vol. 27, No. 6, Juni 1984, pp. 594–602

    Google Scholar 

  7. G. Li, B.W. Wah: Computational Efficiency of Parallel Approximate Branch-and-Bound Algorithms,Proc. of the 1984 International Conference on Parallel Processing, pp. 473–480

    Google Scholar 

  8. E.L. Lawler, D.E. Wood: Branch-and-Bound Methods: A Survey, Operations Research 14 (1966), pp. 699–719

    Article  MathSciNet  MATH  Google Scholar 

  9. R. Luling, B. Monien: Two Strategies for Solving the Vertex Cover Problem on a Transputer Network, akzeptiert für die 3rd International Conference on Distributed Algorithms, Nizza, Sep. 1989

    Google Scholar 

  10. B. Monien, O. Vomberger: Parallel Processing of Combinatorial Search Trees, Proc. of the International Workshop on Parallel Algorithms and Architectures, Mai 1987, Akademie-Verlag Berlin

    Google Scholar 

  11. O. Vomberger: Load Balancing in a Network of Transputers, in: Proceedings of the 2nd International Workshop on Distributed Algorithms, Amsterdam, Juli 1987, pp. 116–126

    Google Scholar 

  12. B.W. Wah, G. Li, Ch.F. Yu: Multiprocessing of Combinatorial Search Problems, Computer, Juni 1985, pp. 93–108

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Mathematik / Informatik, Universität Osnabrück, Albrechtstraße 28, 4500, Osnabrück, Deutschland

    Berthold Kröger & Oliver Vornberger

Authors
  1. Berthold Kröger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliver Vornberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Physiologie der Medizinischen Fakultät Klinikum, RWTH Aachen, Pauwelsstraße, D-5100, Aachen, Deutschland

    Reinhard Grebe

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kröger, B., Vornberger, O. (1990). Parallele Lösung eines Verschnittproblems. In: Grebe, R. (eds) Parallele Datenverarbeitung mit dem Transputer. Informatik-Fachberichte, vol 237. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-84142-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-84142-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52366-6

  • Online ISBN: 978-3-642-84142-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation