Filteren
1
Sorteren
34 resultaten
Serie: Combinatorial optimization
gebonden
Engels20049780387235318
19-11-2004
The author presents polyhedral results and exact solution methods for location problems encountered in telecommunications, but which also have applications in other areas, such as transportation and supply chain management. Meer
gebonden
Engels20049780387235387
19-11-2004
The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology. Meer
gebonden
Engels20069780387290256
28-3-2006
Combinatorial optimization algorithms are used in many applications including the design, management, and operations of communication networks. The objective of this book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Meer
paperback
Engels20079780387444598
18-5-2007
A brilliant treatment of a knotty problem in computing. This volume contains chapters written by reputable researchers and provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). Meer
gebonden
Engels19989780792349501
31-1-1998
Combinatorial Engineering of Decomposable Systems presents a morphological approach to the combinatorial design/synthesis of decomposable systems. Applications involve the following: design (e. Meer
gebonden
Engels19979780792348788
31-12-1997
The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Meer
gebonden
Engels19989780792350026
30-4-1998
At first sight discrete and fractional programming techniques appear to be two com pletely unrelated fields in operations research. We will show how techniques in both fields can be applied separately and in a combined form to particular models in location analysis. Meer
gebonden
Engels20019780792369592
31-7-2001
The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Meer
gebonden
Engels20009780792366898
30-11-2000
As the telecommunication industry introduces new sophisticated technologies, the nature of services and the volume of demands have changed. Indeed, a broad range of new services for users appear, combining voice, data, graphics, video, etc. Meer
gebonden
Engels20019780792370154
31-8-2001
Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Meer
gebonden
Engels19989780792354543
31-12-1998
VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Meer
gebonden
Engels19999780792357148
31-5-1999
The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Meer
gebonden
Engels20009780792361107
31-1-2000
The Volume on Advances in Steiner Trees is divided into two sections. The first section of the book includes papers on the general geometric Steiner tree problem in the plane and higher dimensions. Meer
gebonden
Engels20009780792366461
30-11-2000
Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem, and despite the efforts of many researchers over the past three decades, they still remain some of the hardest combinatorial optimization problems to solve exactly. Meer
paperback
Engels20109781441948564
6-12-2010
Steiner's Problem concerns finding a shortest interconnecting network for a finite set of points in a metric space. A solution must be a tree, which is called a Steiner Minimal Tree (SMT), and may contain vertices different from the points which are to be connected. Meer
paperback
Engels20109781441939685
15-12-2010
Combinatorial optimization algorithms are used in many applications including the design, management, and operations of communication networks. The objective of this book is to advance and promote the theory and applications of combinatorial optimization in communication networks. Meer
paperback
Engels20149781461498537
21-11-2014
The aim in this graduate level text is to outline the key mathematical concepts that underpin these important questions in applied mathematics. These concepts involve discrete mathematics (particularly graph theory), optimization, computer science, and several ideas in biology. Meer
paperback
Engels20149781461374275
9-1-2014
VII Preface In many fields of mathematics, geometry has established itself as a fruitful method and common language for describing basic phenomena and problems as well as suggesting ways of solutions. Meer
paperback
Engels20149781461498520
14-11-2014
The author presents polyhedral results and exact solution methods for location problems encountered in telecommunications, but which also have applications in other areas, such as transportation and supply chain management. Meer
paperback
Engels20119781461332848
12-10-2011
The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Meer