Combinatorial Optimization – serie
Visar alla böcker i serien Combinatorial Optimization. Handla med fri frakt och snabb leverans.
34 produkter
Concentrator Location in Telecommunications Networks
Av Hande Yaman
Inbunden, 2004
1098 kr
Lägg i varukorg
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.
Shortest Connectivity
An Introduction with Applications in Phylogeny
Inbunden, 2004
1098 kr
Lägg i varukorg
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.
Combinatorial Optimization in Communication Networks
Av Maggie Xiaoyan Cheng, Yingshu Li m. fl.
Inbunden, 2006
1643 kr
Lägg i varukorg
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. Each chapter of …
Traveling Salesman Problem and Its Variations
Av G. Gutin, A.P. Punnen
Häftad, 2007
3279 kr
Lägg i varukorg
This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and …
Quadratic Assignment Problem
Theory and Algorithms
Av E. Cela
Inbunden, 1997
1643 kr
Lägg i varukorg
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. Nowadays the QAP is widely …
Combinatorial Engineering of Decomposable Systems
Av M.S. Levin
Inbunden, 1998
1643 kr
Lägg i varukorg
Combinatorial Engineering of Decomposable Systems presents a morphological approach to the combinatorial design/synthesis of decomposable systems. Applications involve the following: design (e.g., information systems; user's interfaces; educational courses); planning (e.g., problem-solving …
Discrete and Fractional Programming Techniques for Location Models
Av A.I. Barros
Inbunden, 1998
1207 kr
Lägg i varukorg
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. Location analysis deals with …
Geometric Methods and Optimization Problems
Av Vladimir Boltyanski, Horst Martini m. fl.
Inbunden, 1998
3061 kr
Lägg i varukorg
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. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed …
Advances in Randomized Parallel Computing
Av M. Pardalos Pardalos, Panos M. Pardalos m. fl.
Inbunden, 1999
1643 kr
Lägg i varukorg
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. Randomized algorithms …
Advances in Steiner Trees
Av Ding-Zhu Du, J.M. Smith m. fl.
Inbunden, 2000
1098 kr
Lägg i varukorg
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. The second section of the book includes papers on the Steiner problem on graphs. The general …
Nonlinear Assignment Problems
Algorithms and Applications
Av Panos M. Pardalos, L.S. Pitsoulis
Inbunden, 2000
1643 kr
Lägg i varukorg
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. The purpose of this book is to …
Network Synthesis Problems
Av C. Wynants
Inbunden, 2000
1098 kr
Lägg i varukorg
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. This implies new planning issues. Fiber transmission …
Handbook of Randomized Computing
Volume I/II
Av Sanguthevar Rajasekaran, Panos M. Pardalos m. fl.
2001
651 kr
Lägg i varukorg
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. Randomized algorithms …
Steiner Ratio
Inbunden, 2001
1098 kr
Lägg i varukorg
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. Steiner's Problem is one of the …
Steiner Trees in Industry
Inbunden, 2001
2188 kr
Lägg i varukorg
This volume is a collection of 16 articles contributed by influential experts in the field of Steiner tree applications. The articles are designed to explore the impact on industries of the long-term theoretical development of Steiner tree problems. The authors address various Steiner tree problems …
Traveling Salesman Problem and Its Variations
Av G. Gutin, A.P. Punnen
Inbunden, 2002
3279 kr
Lägg i varukorg
This volume, which contains chapters written by reputable researchers, provides the state of the art in theory and algorithms for the traveling salesman problem (TSP). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and …
Pattern Recognition and String Matching
Av Dechang Chen, Xiuzhen Cheng
Inbunden, 2003
1098 kr
Lägg i varukorg
The research and development of pattern recognition have proven to be of importance in science, technology, and human activity. Many useful concepts and tools from different disciplines have been employed in pattern recognition. Among them is string matching, which receives much theoretical and …
Multilevel Optimization in VLSICAD
Av Jingsheng Jason Cong, Joseph R. Shinnerl
Inbunden, 2003
1643 kr
Lägg i varukorg
In the last few decades, multiscale algorithms have become a dominant trend in large-scale scientific computation. Researchers have successfully applied these methods to a wide range of simulation and optimization problems. This book gives a general overview of multiscale algorithms; applications …
Discrete Ordered Median Problem: Models and Solution Methods
Models and Solution Methods
Inbunden, 2003
552 kr
Lägg i varukorg
This is the first book about the discrete ordered median problem (DOMP), which unifies many classical and new facility location problems. Several exact and heuristic approaches are developed in this book in order to solve the DOMP.Audience: The book is suitable for researchers in location theory, …
Combinatorial Optimization in Communication Networks
Av Maggie Xiaoyan Cheng, Yingshu Li m. fl.
Häftad, 2010
1643 kr
Lägg i varukorg
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. Each chapter of …
Quadratic Assignment Problem
Theory and Algorithms
Av E. Cela
Häftad, 2010
1643 kr
Lägg i varukorg
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. Nowadays the QAP is widely …
Advances in Steiner Trees
Av Ding-Zhu Du, J.M. Smith m. fl.
Häftad, 2010
1098 kr
Lägg i varukorg
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. The second section of the book includes papers on the Steiner problem on graphs. The general …
Nonlinear Assignment Problems
Algorithms and Applications
Av Panos M. Pardalos, L.S. Pitsoulis
Häftad, 2010
1643 kr
Lägg i varukorg
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. The purpose of this book is to …
Network Synthesis Problems
Av C. Wynants
Häftad, 2010
1098 kr
Lägg i varukorg
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. This implies new planning issues. Fiber transmission …
Steiner Ratio
Häftad, 2010
1098 kr
Lägg i varukorg
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. Steiner's Problem is one of the …
Multilevel Optimization in VLSICAD
Av Jingsheng Jason Cong, Joseph R. Shinnerl
Häftad, 2011
1643 kr
Lägg i varukorg
In the last few decades, multiscale algorithms have become a dominant trend in large-scale scientific computation. Researchers have successfully applied these methods to a wide range of simulation and optimization problems. This book gives a general overview of multiscale algorithms; applications …
Advances in Randomized Parallel Computing
Av Panos M. Pardalos, Sanguthevar Rajasekaran
Häftad, 2011
1692 kr
Lägg i varukorg
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. Randomized algorithms …
Handbook of Randomized Computing
Volume I/II
Av Sanguthevar Rajasekaran, Panos M. Pardalos m. fl.
Häftad, 2013
552 kr
Lägg i varukorg
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. Randomized algorithms …
Discrete and Fractional Programming Techniques for Location Models
Av A.I. Barros
Häftad, 2013
552 kr
Lägg i varukorg
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. Location analysis deals with …
Geometric Methods and Optimization Problems
Av Vladimir Boltyanski, Horst Martini m. fl.
Häftad, 2014
1643 kr
Lägg i varukorg
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. Especially in pure mathematics this is ob vious and well-known (examples are the much discussed …
