By Dr. R. von Randow (auth.), Dr. R. von Randow (eds.)

The fields of integer programming and combinatorial optimization remain components of serious energy, with an ever expanding variety of courses and journals showing. A categorized bibliography therefore remains to be worthy and important this day, much more so than it did while the venture, of which this can be the 5th quantity, was once began in 1970 within the Institut fur Okonometrie und Operations learn of the college of Bonn. The pioneering first quantity was once compiled by means of Claus Kastning throughout the years 1970 - 1975 and seemed in 1976 as quantity 128 of the sequence Lecture Notes in Economics and Mathematical platforms released through the Springer Verlag. paintings at the undertaking used to be persevered via Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and ended in the e-book of the second one, 3rd, and fourth volumes in 1978, 1982, and 1985 (Volumes a hundred and sixty, 197, and 243 of the above series). the current publication constitutes the 5th quantity of the bibliography and covers the interval from autumn 1984 to the tip of 1987. It comprises 5864 new courses via 4480 authors and used to be compiled by means of Rabe von Randow. Its shape is essentially just like that of the 1st 4 volumes, a few additions having been made to the topic list.

Show description

Read or Download Integer Programming and Related Areas: A Classified Bibliography 1984–1987, Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn PDF

Similar programming books

Learn to Program

It's now more uncomplicated to benefit to write down your personal software program than it has ever been ahead of. Now every body can learn how to write courses for themselves--no earlier adventure is important. Chris Pine takes a thorough, yet light-hearted strategy that teaches you ways to application with not less than fuss or hassle.

Design and Prototyping for Drupal

Itching to construct attention-grabbing initiatives with Drupal, yet pressured incidentally it handles layout demanding situations? This concise advisor is helping small groups and solo site designers know the way Drupal works via demonstrating the methods it outputs content material. You’ll the best way to deal with Drupal’s output, layout round it, after which flip your layout right into a theme.

within the moment of 3 volumes on Drupal layout, award-winning clothier Dani Nordin takes you past simple website making plans and teaches you key innovations for operating with issues, layouts, and wireframes. become aware of tips on how to use Drupal to make your imaginative and prescient a fact, rather than getting distracted by way of the system’s undertaking and code administration details.
* examine concepts for sketching, wireframing, and designing powerful layouts
* holiday down a Drupal structure to appreciate its uncomplicated elements
* comprehend Drupal’s subject matter layer, and what to seem for in a base subject matter
* paintings with the 960 grid process to facilitate effective wireframing and theming
* deal with Drupal markup, together with the code generated by way of the robust perspectives module
* Use LessCSS to arrange CSS and assist you subject matter your website extra successfully

Parallele Programmierung

Durch kostengünstige Multiprozessor-Desktoprechner, Cluster von desktops und Innovationen wie die Hyperthreading-Technologie oder Multicore-Prozessoren sind parallele Rechenressourcen allgegenwärtig. Die effiziente Ausnutzung dieser parallelen Rechenleistung ist jedoch nur durch den Einsatz paralleler Programmiertechniken möglich, die sich damit in alle Bereiche der Softwareerstellung ausbreiten.

Additional resources for Integer Programming and Related Areas: A Classified Bibliography 1984–1987, Compiled at the Institut für Ökonometrie und Operations Research, University of Bonn

Example text

Bereznev, V. ; Palmova, I. ; Tretyakov, A. A. On an optimization problem of the cutting-out of materials (Russian). In: N. P. Bakhvalov, V. G. Karmanov, V. A. ): Numerical analysis: methods, algorithms, programs; Collection of articles, 41-50. Moscow: Izdatel'stvo Moskovskogo Universiteta. (1983). Bereznev, V. ; Palmova, I. ; Tretyakov, A. A. A method for solving a class of problems of linear integer programming with Boolean variables (Russian). In: Methods and Algorithms in Numerical Analysis, 76-85.

Berlin: Springer-Verlag. (1985). ; Mehlhorn, K. Algorithms for routing in planar graphs. Acta Informatica 23,163-176. (1986). Becker, R. ; Perl, Y. Finding the two-core of a tree. Discrete Applied Mathematics 11, 103-114. (1985). Becker, R. ; Schach, S. R. A bottom-up algorithm for weight- and height-bounded minimal partition of trees. International Journal of Computer Mathematics 16, 211-228. (1984). Becker, R. ; Schach, S. R. A bottom-up algorithm for weight- and height-bounded minimal partition of trees.

Y. Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society 38, 423430. (1987). 1985-1 Berman, A. Convexity, graph theory and non-negative matrices. In: M. Rosenfeld, J. ): Convexity and Graph Theory. Annals of Discrete Mathematics Vol. 20, 55-60. Amsterdam: North-Holland. (1985). 1984-1 Berman, K. A. ry matroids of the weighted matrix-tree theorem in the case when the weights are Boolean. European Journal of Combinatorics 5, 197-205. (1984). 1986-1 Berman, K. A.

Download PDF sample

Rated 4.41 of 5 – based on 19 votes