Pardalos Panos M Pardalos – författare
Visar alla böcker från författaren Pardalos Panos M Pardalos. Handla med fri frakt och snabb leverans.
9 produkter
9 produkter
E-bok
Engelska, 20171 403 kr
Läs direkt efter köp
This comprehensive reference text is a collection of important research findings on the latest developments in network modeling for optimization of smart cities. Such models can be used from outlining the fundamental concepts of urban development to the description and optimization of physical networks, such as power, water or telecommunications. Networks help us understand city economics and various aspects of human interactions within cities with particular applications in quality of life and the flow of people and goods. Finally, the natural environment and even the climate of cities can be modeled and managed as networks.
E-bok
PDF, Engelska, 2009859 kr
Läs direkt efter köp
This volume presents a collection of papers dealing with various aspects of clustering in biological networks and other related problems in computational biology. It consists of two parts, with the first part containing surveys of selected topics and the second part presenting original research contributions. This book will be a valuable source of material to faculty, students, and researchers in mathematical programming, data analysis and data mining, as well as people working in bioinformatics, computer science, engineering, and applied mathematics. In addition, the book can be used as a supplement to any course in data mining or computational/systems biology.
E-bok
PDF, Engelska, 2004867 kr
Läs direkt efter köp
Over the past several years, cooperative control and optimization have increasingly played a larger and more important role in many aspects of military sciences, biology, communications, robotics, and decision making. At the same time, cooperative systems are notoriously difficult to model, analyze, and solve — while intuitively understood, they are not axiomatically defined in any commonly accepted manner. The works in this volume provide outstanding insights into this very complex area of research. They are the result of invited papers and selected presentations at the Fourth Annual Conference on Cooperative Control and Optimization held in Destin, Florida, November 2003.This book has been selected for coverage in:• Index to Scientific & Technical Proceedings® (ISTP® / ISI Proceedings)• Index to Scientific & Technical Proceedings (ISTP CDROM version / ISI Proceedings)• CC Proceedings — Engineering & Physical Sciences
E-bok
PDF, Engelska, 2004607 kr
Läs direkt efter köp
This book describes recently developed mathematical models, methodologies, and case studies in diverse areas, including stock market analysis, portfolio optimization, classification techniques in economics, supply chain optimization, development of e-commerce applications, etc. It will be of interest to both theoreticians and practitioners working in economics and finance.
E-bok
PDF, Engelska, 20031 002 kr
Läs direkt efter köp
This volume gives the latest advances in optimization and optimal control which are the main part of applied mathematics. It covers various topics of optimization, optimal control and operations research.
E-bok
PDF, Engelska, 2002730 kr
Läs direkt efter köp
Combinatorial and global optimization problems appear in a wide range of applications in operations research, engineering, biological science, and computer science. In combinatorial optimization and graph theory, many approaches have been developed that link the discrete universe to the continuous universe through geometric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. Recent major successes based on these approaches include interior point algorithms for linear and discrete problems, the celebrated Goemans-Williamson relaxation of the maximum cut problem, and the Du-Hwang solution of the Gilbert-Pollak conjecture. Since integer constraints are equivalent to nonconvex constraints, the fundamental difference between classes of optimization problems is not between discrete and continuous problems but between convex and nonconvex optimization problems. This volume is a selection of refereed papers based on talks presented at a conference on “Combinatorial and Global Optimization” held at Crete, Greece.
E-bok
PDF, Engelska, 2001502 kr
Läs direkt efter köp
The rapid changes that have taken place globally on the economic, social and business fronts characterized the 20th century. The magnitude of these changes has formed an extremely complex and unpredictable decision-making framework, which is difficult to model through traditional approaches. The main purpose of this book is to present the most recent advances in the development of innovative techniques for managing the uncertainty that prevails in the global economic and management environments. These techniques originate mainly from fuzzy sets theory. However, the book also explores the integration of fuzzy sets with other decision support and modeling disciplines, such as multicriteria decision aid, neural networks, genetic algorithms, machine learning, chaos theory, etc. The presentation of the advances in these fields and their real world applications adds a new perspective to the broad fields of management science and economics.
E-bok
PDF, Engelska, 1993931 kr
Läs direkt efter köp
Computational complexity, originated from the interactions between computer science and numerical optimization, is one of the major theories that have revolutionized the approach to solving optimization problems and to analyzing their intrinsic difficulty.The main focus of complexity is the study of whether existing algorithms are efficient for the solution of problems, and which problems are likely to be tractable.The quest for developing efficient algorithms leads also to elegant general approaches for solving optimization problems, and reveals surprising connections among problems and their solutions.This book is a collection of articles on recent complexity developments in numerical optimization. The topics covered include complexity of approximation algorithms, new polynomial time algorithms for convex quadratic minimization, interior point algorithms, complexity issues regarding test generation of NP-hard problems, complexity of scheduling problems, min-max, fractional combinatorial optimization, fixed point computations and network flow problems.The collection of articles provide a broad spectrum of the direction in which research is going and help to elucidate the nature of computational complexity in optimization. The book will be a valuable source of information to faculty, students and researchers in numerical optimization and related areas.
E-bok
PDF, Engelska, 1993831 kr
Läs direkt efter köp
In the past few decades, there has been a large amount of work on algorithms for linear network flow problems, special classes of network problems such as assignment problems (linear and quadratic), Steiner tree problem, topology network design and nonconvex cost network flow problems.Network optimization problems find numerous applications in transportation, in communication network design, in production and inventory planning, in facilities location and allocation, and in VLSI design.The purpose of this book is to cover a spectrum of recent developments in network optimization problems, from linear networks to general nonconvex network flow problems.