Integer Programming and Related Areas: A Classified by Dr. R. von Randow (auth.), Dr. R. von Randow (eds.)

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

The fields of integer programming and combinatorial optimization remain parts of significant power, with an ever expanding variety of courses and journals showing. A categorised bibliography therefore remains to be useful and helpful at the present time, much more so than it did while the undertaking, of which this is often the 5th quantity, was once begun in 1970 within the Institut fur Okonometrie und Operations learn of the collage of Bonn. The pioneering first quantity used to be compiled through Claus Kastning in the course of the years 1970 - 1975 and seemed in 1976 as quantity 128 of the sequence Lecture Notes in Economics and Mathematical structures released by way of the Springer Verlag. paintings at the venture was once endured by way of Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and led to the e-book of the second one, 3rd, and fourth volumes in 1978, 1982, and 1985 (Volumes one hundred 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 was once compiled by means of Rabe von Randow. Its shape is virtually 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

Scratch 2.0 Beginner's Guide (2nd Edition)

As twenty first century humans, we are living a electronic existence, yet desktop scientists world wide warn of a declining pool of digitally literate laptop technology scholars. The Scratch surroundings makes it enjoyable for college kids of any age to imagine, create, and collaborate digitally.

Scratch 2. zero Beginner's consultant moment variation will educate you the way to turn into a Scratch programmer and lay the root for programming in any laptop language. even if you're making a birthday card or cloning bricks for a online game of Breakout, tasks are approached in a step by step solution to assist you layout, create, and give some thought to each one programming workout.

Automata, Languages and Programming: 25th International Colloquium, ICALP'98 Aalborg, Denmark, July 13–17, 1998 Proceedings

This e-book constitutes the refereed complaints of the twenty fifth overseas Colloquium on Automata, Languages and Programming, ICALP'98, held in Aalborg, Denmark, in July 1998. The 70 revised complete papers provided including 8 invited contributions have been rigorously chosen from a complete of 182 submissions.

FAQ по Microsoft Windows Vista

Этот сборник часто задаваемых вопросов по home windows Vista был собран по материалам форума OSzone. web. Он будет полезен как для решения конкретных задачу, так и в ознакомительных целях. Возможно при прочтении данного FAQ вы узнаете что-то новое и полезное, то чем вы сможете воспользоваться в будущем. Здесь я старался собрать вопросы, которые еще не рассматривались ране, вопросы, которые относятся в первую очередь к home windows Vista, хотя фактически львиная доля вопросов, описанных в FAQ по home windows XP применима и к этой системе.

LEGO MINDSTORMS NXT-G Programming Guide, Second Edition (Practical Projects)

James Kelly’s LEGO MINDSTORMS NXT-G Programming advisor, moment version is a fountain of knowledge and ideas for these trying to grasp the paintings of programming LEGO’s MINDSTORMS NXT robotics kits. This moment variation is fully-updated to hide all of the most up-to-date gains and elements within the NXT 2. zero sequence. it is also workouts on the finish of every bankruptcy and different content material feedback from educators and different readers of the 1st version.

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

Sample text

Discrete Mathematics 66, 203-208. (1987). ; Fouquet, J. ; Jolivet, J. ; Riviere, M. On a special face colouring of cubic graphs. Ars Combinatoria 24, 67-76. (1987). Bouchitte, V. Chordal bipartite graphs and crowns. Order 2, 119-122. (1985). ; Habib, M. Some NP-completeness properties about linear extensions. Rapport de Recherche 11. Brest: Univ. de Bretagne Occidentale, 14 p. (1986). ; Jegou, R. On the greedy dimension of a partial order. Order 1, 219-224. (1985). -M. Integral and fractional node packings, and pseudo-Boolean programming.

Node-weighted graphs having the Konig-Egervary property. Mathematical Programming Study 22, 44-63. (1984). Bovet, J. Une amelioration de la methode de Dijkstra pour la recherche d'un plus court chemin dans un reseau. Discrete Applied Mathematics 13,93-96. (1986). Boxma, O. J. A probabilistic analysis of the LPT scheduling rule. In: E. ): Performance '84 (Paris 1984),475-490. Amsterdam, New York: North-Holland. (1985). Boxma, O. ; Forst, F. G. Minimizing the expected weighted number of tardy jobs in stochastic flow shops.

Pulleyblank, W. ; Cornuejols, G. Travel - an interactive travelling salesman problem package for the IBM-personal computer. Operations Research Letters 6, 141-144. (1987). Bracho, R. L. Le nombre achromatique d'une etoile. Ars Combinatoria 18, 187-194. (1984). Brameller, A. Sparsity in transportation problems. In: D. ): Sparsity and its applicatins, 229-242. (Meeting Loughborough, England, 1983). Cambridge: Cambridge Univ. Press. (1984). Brandeau, M. ; Chiu, S. ; Batta, R. Locating the 2-median of a tree network with continuous link demands.

Download PDF sample

Rated 4.55 of 5 – based on 4 votes