Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Functional analysis --- Convex sets --- Convex functions --- Ensembles convexes --- Fonctions convexes --- Mathematics --- Linear Programming --- Combinatorics --- Geometry

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

The research area of graph grammars and graph transformations dates back only two decades. But already methods and results from the area of graph transformation have been applied in many fields of computer science, such as formal language theory, pattern recognition and generation, compiler construction, software engineering, concurrent and distributed systems modelling, and database design and theory. This volume contains 24 selected and revised papers from an international seminar held in Dagstuhl, Germany, in 1993. The papers cover topics in the following areas: foundations of graph grammars and transformations; and applications of graph transformations to concurrent computing, specification and programming, and pattern generation and recognition.

Computer. Automation --- Discrete mathematics --- Computer science --- Congresses --- Computer graphics --- Optical pattern recognition. --- Information theory. --- Computer science. --- Combinatorics. --- Software engineering. --- Data structures (Computer scienc. --- Pattern Recognition. --- Theory of Computation. --- Mathematical Logic and Formal Languages. --- Software Engineering. --- Data Structures. --- Computer software engineering --- Engineering --- Combinatorics --- Algebra --- Mathematical analysis --- Informatics --- Science --- Communication theory --- Communication --- Cybernetics --- Optical data processing --- Pattern perception --- Perceptrons --- Visual discrimination

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This volume is the proceedings of the first International Workshop on Orders, Algorithms, and Applications, held at Lyon, France in July 1994. Ordered sets and the more specifically algorithmic aspects of order theory are of increasing importance, for example in graph theory. They enjoy a recognized place in computer science as well as in mathematics, due to various new developments in the last few years. The nine technical papers accepted for this volume and the four invited papers presented offer a representative perspective on theoretical and applicational aspects of orders and related algorithms.

Ordered sets --- Congresses --- Algorithms --- Graph theory --- Information theory. --- Data structures (Computer scienc. --- Computer software. --- Numerical analysis. --- Combinatorics. --- Theory of Computation. --- Mathematical Modeling and Industrial Mathematics. --- Data Structures and Information Theory. --- Algorithm Analysis and Problem Complexity. --- Numerical Analysis. --- Combinatorics --- Algebra --- Mathematical analysis --- Software, Computer --- Computer systems --- Communication theory --- Communication --- Cybernetics

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Finite fields (Algebra) --- Corps finis --- 512.62 --- 519.1 --- #KVIV:BB --- #KOPO:Prof. R. Holvoet --- 519.72 --- Modular fields (Algebra) --- Algebra, Abstract --- Algebraic fields --- Galois theory --- Modules (Algebra) --- Fields. Polynomials --- Combinatorics. Graph theory --- Information theory: mathematical aspects --- Finite fields (Algebra). --- 519.72 Information theory: mathematical aspects --- 519.1 Combinatorics. Graph theory --- 512.62 Fields. Polynomials

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Still today I am receiving requests for reprints of the book, but unfortunately it is out of print. Therefore, since the book still seems to receive some attention, I p- posed to Springer Verlag to provide a free online edition. I am very happy that Springer agreed. Except for the correction of some typographical errors, the online edition is just a copy of the printed version, no updates have been made. In particular, Table 13.1 gives the status of TSPLIB at the time of publishing the book. For accessing TSPLIB the link http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95/ should be used instead of following the procedure described in Chapter 13. Heidelberg, January 2001 Gerhard Reinelt Preface More than ?fteen years ago, I was faced with the following problem in an assignment for a class in computer science. A brewery had to deliver beer to ?ve stores, and the task was to write a computer program for determining the shortest route for the truck driver to visit all stores and return to the brewery. All my attemps to ?nd a reasonable algorithm failed, I could not help enumerating all possible routes and then select the best one.

Computer. Automation --- Operational research. Game theory --- Algorithms. --- Heuristic programming. --- Traveling-salesman problem. --- Computer graphics. --- Combinatorics. --- Information technology. --- Engineering. --- Operations research. --- Computer Graphics. --- IT in Business. --- Complexity. --- Operations Research/Decision Theory. --- Operational analysis --- Operational research --- Industrial engineering --- Management science --- Research --- System theory --- Construction --- Industrial arts --- Technology --- IT (Information technology) --- Telematics --- Information superhighway --- Knowledge management --- Algorism --- Algebra --- Arithmetic --- Combinatorics --- Mathematical analysis --- Automatic drafting --- Graphic data processing --- Graphics, Computer --- Computer art --- Graphic arts --- Electronic data processing --- Engineering graphics --- Image processing --- Foundations --- Digital techniques