You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
The quadratic binary optimization problem (QUBO) is a versatile combinatorial optimization model with a variety of applications and rich theoretical properties. Application areas of the model include finance, cluster analysis, traffic management, machine scheduling, VLSI physical design, physics, quantum computing, engineering, and medicine. In addition, various mathematical optimization models can be reformulated as a QUBO, including the resource constrained assignment problem, set partitioning problem, maximum cut problem, quadratic assignment problem, the bipartite unconstrained binary optimization problem, among others. This book presents a systematic development of theory, algorithms, a...
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). The book covers all important areas of study on TSP, including polyhedral theory for symmetric and asymmetric TSP, branch and bound, and branch and cut algorithms, probabilistic aspects of TSP, and includes a thorough computational analysis of heuristic and metaheuristic algorithms.
This book presents a selection of advanced case studies that cover a substantial range of issues and real-world challenges and applications in space engineering. Vital mathematical modeling, optimization methodologies and numerical solution aspects of each application case study are presented in detail, with discussions of a range of advanced model development and solution techniques and tools. Space engineering challenges are discussed in the following contexts: •Advanced Space Vehicle Design •Computation of Optimal Low Thrust Transfers •Indirect Optimization of Spacecraft Trajectories •Resource-Constrained Scheduling, •Packing Problems in Space •Design of Complex Interplanetary...
While the areas of information management and management science are full of algorithmic challenges, the proliferation of data has called for the design of e?cient and e?ective algorithms and data structures for their management and processing. The International Conference on Algorithmic Aspects in Information and Management(AAIM) is intended for originalalgorithmicresearchon immediate applications and/or fundamental problems pertinent to information mana- ment and management science to be broadly construed. The conference aims at bringing together researchers in computer science, operations research, applied mathematics, economics, and related disciplines. This volume contains papers presen...
How a new mathematical field grew and matured in America Graph Theory in America focuses on the development of graph theory in North America from 1876 to 1976. At the beginning of this period, James Joseph Sylvester, perhaps the finest mathematician in the English-speaking world, took up his appointment as the first professor of mathematics at the Johns Hopkins University, where his inaugural lecture outlined connections between graph theory, algebra, and chemistry—shortly after, he introduced the word graph in our modern sense. A hundred years later, in 1976, graph theory witnessed the solution of the long-standing four color problem by Kenneth Appel and Wolfgang Haken of the University o...
This book constitutes the proceedings of the 4th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2018, held in Guwahati, India, in February 2018. The 23 papers presented in this volume were carefully reviewed and selected from 68 submissions. They focus on topics related to efficient algorithms and data structures, their analysis (both theoretical and experimental). The mathematical problems arising thereof, and new applications of discrete mathematics, advances in existing applications and development of new tools for discrete mathematics.
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics. Starting with basic approaches, the handbook presents the methodologies to design and analyze efficient approximation algorithms for a large class of problems, and to establish inapproximability results for another class of problems. It also discusses local search, neural networks, and metaheuristics, as well as multiobjective problems, sensitivity analysis, and stability. After laying this foundation, the bo...
This book constitutes the refereed proceedings of the Third International Workshop on Experimental and Efficient Algorithms, WEA 2004, held in Angra dos Reis, Brazil in May 2004. The 40 revised full papers presented together with abstracts of two invited talks were carefully reviewed and selected from numerous submissions. The book is devoted to the areas of design, analysis, and experimental evaluation of algorithms. Among the topics covered are scheduling, heuristics, combinatorial optimization, evolutionary optimization, graph computations, labeling, robot navigation, shortest path algorithms, flow problems, searching, randomization and derandomization, string matching, graph coloring, networking, error detecting codes, timetabling, sorting, energy minimization, etc.
The current sharing economy suffers from system-wide deficiencies even as it produces distinctive benefits and advantages for some participants. The first generation of sharing markets has left us to question: Will there be any workers in the sharing economy? Can we know enough about these technologies to regulate them? Is there any way to avoid the monopolization of assets, information, and wealth? Using convergent, transdisciplinary perspectives, this volume examines the challenge of reengineering a sharing economy that is more equitable, democratic, sustainable, and just. The volume enhances the reader's capacity for integrating applicable findings and theories in business, law and social science into ethical engineering design and practice. At the same time, the book helps explain how technological innovations in the sharing economy create value for different stakeholders and how they impact society at large. Reengineering the Sharing Economy is also available as Open Access on Cambridge Core.
BrunoBuchberger This book is a synopsis of basic and applied research done at the various re search institutions of the Softwarepark Hagenberg in Austria. Starting with 15 coworkers in my Research Institute for Symbolic Computation (RISC), I initiated the Softwarepark Hagenberg in 1987 on request of the Upper Aus trian Government with the objective of creating a scienti?c, technological, and economic impulse for the region and the international community. In the meantime, in a joint e?ort, the Softwarepark Hagenberg has grown to the current (2009) size of over 1000 R&D employees and 1300 students in six research institutions, 40 companies and 20 academic study programs on the bachelor, maste...