Zobrazeno 1 - 10
of 12
pro vyhledávání: '"511.1"'
Autor:
Illa Weiss
The resource transfer problem (RTP) is a modeling and solution framework for integrated complex scheduling and rich vehicle routing problems. It allows the modeling of a wide variety of scheduling problems, vehicle routing problems, their combination
Autor:
Jorgen Bang-Jensen, Gregory Z. Gutin
Graph theory is a very popular area of discrete mathematics with not only numerous theoretical developments, but also countless applications to prac tical problems. As a research area, graph theory is still relatively young, but it is maturing rapi
Autor:
Bernhard Korte, Jens Vygen
It was more than a surprise to us that the first edition of this book already went out of print about a year after its first appearance. We were flattered by the many positive and even enthusiastic comments and letters from colleagues and the gen e
Autor:
Bernhard Korte, Jens Vygen
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. It became a subject in its own right about 50 years ago. This book describes the most important ideas, theoretic
Autor:
L. R. Foulds
The major purpose of this book is to introduce the main concepts of discrete optimization problems which have a finite number of feasible solutions. Following common practice, we term this topic combinatorial optimization. There are now a number of e
Ever since the discovery of the five platonic solids in ancient times, the study of symmetry and regularity has been one of the most fascinating aspects of mathematics. Quite often the arithmetical regularity properties of an object imply its uniquen
Autor:
Dimitris Alevras, Manfred W. Padberg
Books on a technical topic - like linear programming - without exercises ignore the principal beneficiary of the endeavor of writing a book, namely the student - who learns best by doing course. Books with exercises - if they are challenging or at le
Autor:
Bernhard Korte, Jens Vygen
This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and spe
Since the publication of the first edition of our book, geometric algorithms and combinatorial optimization have kept growing at the same fast pace as before. Nevertheless, we do not feel that the ongoing research has made this book outdated. Rather,