Download or read book Discrete Optimization with Interval Data written by Adam Kasperski and published by Springer Science & Business Media. This book was released on 2008-06-04 with total page 225 pages. Available in PDF, EPUB and Kindle. Book excerpt: Operations research often solves deterministic optimization problems based on elegantand conciserepresentationswhereall parametersarepreciselyknown. In the face of uncertainty, probability theory is the traditional tool to be appealed for, and stochastic optimization is actually a signi?cant sub-area in operations research. However, the systematic use of prescribed probability distributions so as to cope with imperfect data is partially unsatisfactory. First, going from a deterministic to a stochastic formulation, a problem may becomeintractable. Agoodexampleiswhengoingfromdeterministictostoch- tic scheduling problems like PERT. From the inception of the PERT method in the 1950’s, it was acknowledged that data concerning activity duration times is generally not perfectly known and the study of stochastic PERT was launched quite early. Even if the power of today’s computers enables the stochastic PERT to be addressed to a large extent, still its solutions often require simplifying assumptions of some kind. Another di?culty is that stochastic optimization problems produce solutions in the average. For instance, the criterion to be maximized is more often than not expected utility. This is not always a meaningful strategy. In the case when the underlying process is not repeated a lot of times, let alone being one-shot, it is not clear if this criterion is realistic, in particular if probability distributions are subjective. Expected utility was proposed as a rational criterion from ?rst principles by Savage. In his view, the subjective probability distribution was - sically an artefact useful to implement a certain ordering of solutions.
Download or read book Robust Discrete Optimization and Its Applications written by Panos Kouvelis and published by Springer Science & Business Media. This book was released on 2013-03-09 with total page 373 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book deals with decision making in environments of significant data un certainty, with particular emphasis on operations and production management applications. For such environments, we suggest the use of the robustness ap proach to decision making, which assumes inadequate knowledge of the decision maker about the random state of nature and develops a decision that hedges against the worst contingency that may arise. The main motivating factors for a decision maker to use the robustness approach are: • It does not ignore uncertainty and takes a proactive step in response to the fact that forecasted values of uncertain parameters will not occur in most environments; • It applies to decisions of unique, non-repetitive nature, which are common in many fast and dynamically changing environments; • It accounts for the risk averse nature of decision makers; and • It recognizes that even though decision environments are fraught with data uncertainties, decisions are evaluated ex post with the realized data. For all of the above reasons, robust decisions are dear to the heart of opera tional decision makers. This book takes a giant first step in presenting decision support tools and solution methods for generating robust decisions in a variety of interesting application environments. Robust Discrete Optimization is a comprehensive mathematical programming framework for robust decision making.
Download or read book Combinatorial Optimization and Applications written by Andreas Dress and published by Springer. This book was released on 2007-08-29 with total page 392 pages. Available in PDF, EPUB and Kindle. Book excerpt: Running to almost 400 pages, and featuring more than 40 papers, this work on combinatorial optimization and applications will be seen as an important addition to the literature. It constitutes the refereed proceedings of the first International Conference on Combinatorial Optimization and Applications, COCOA 2007, held in Xi'an, China in August of that year. The 29 revised full papers presented together with 8 invited papers and 2 invited presentations were carefully reviewed and selected from 114 submissions and cover both theoretical issues and practical applications.
Download or read book Robustness Analysis in Decision Aiding Optimization and Analytics written by Michael Doumpos and published by Springer. This book was released on 2016-07-12 with total page 321 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book provides a broad coverage of the recent advances in robustness analysis in decision aiding, optimization, and analytics. It offers a comprehensive illustration of the challenges that robustness raises in different operations research and management science (OR/MS) contexts and the methodologies proposed from multiple perspectives. Aside from covering recent methodological developments, this volume also features applications of robust techniques in engineering and management, thus illustrating the robustness issues raised in real-world problems and their resolution within advances in OR/MS methodologies. Robustness analysis seeks to address issues by promoting solutions, which are acceptable under a wide set of hypotheses, assumptions and estimates. In OR/MS, robustness has been mostly viewed in the context of optimization under uncertainty. Several scholars, however, have emphasized the multiple facets of robustness analysis in a broader OR/MS perspective that goes beyond the traditional framework, seeking to cover the decision support nature of OR/MS methodologies as well. As new challenges emerge in a “big-data'” era, where the information volume, speed of flow, and complexity increase rapidly, and analytics play a fundamental role for strategic and operational decision-making at a global level, robustness issues such as the ones covered in this book become more relevant than ever for providing sound decision support through more powerful analytic tools.
Download or read book Discrete Optimization I written by and published by Elsevier. This book was released on 2000-04-01 with total page 450 pages. Available in PDF, EPUB and Kindle. Book excerpt: Discrete Optimization I
Download or read book Fuzzy Optimization written by Weldon A. Lodwick and published by Springer Science & Business Media. This book was released on 2010-07-12 with total page 535 pages. Available in PDF, EPUB and Kindle. Book excerpt: This potent area of technology allows us to formulate and solve a multitude of problems. Written by leading experts, this overview covers a number of aspects of fuzzy optimization, some related general issues, and various applications of this powerful tool.
Download or read book Combinatorial Optimization written by Raffaele Cerulli and published by Springer. This book was released on 2016-09-09 with total page 452 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the thoroughly refereed post-conference proceedings of the 4th International Symposium on Combinatorial Optimization, ISCO 2016, held in Vietri sul Mare, Italy, in May 2016. The 38 revised full papers presented in this book were carefully reviewed and selected from 98 submissions. They present original research on all aspects of combinatorial optimization, such as algorithms and complexity; mathematical programming; operations research; stochastic optimization; and graphs and combinatorics.
Download or read book Handbook on Project Management and Scheduling Vol 2 written by Christoph Schwindt and published by Springer. This book was released on 2015-01-13 with total page 768 pages. Available in PDF, EPUB and Kindle. Book excerpt: Due to the increasing importance of product differentiation and collapsing product life cycles, a growing number of value-adding activities in the industry and service sector are organized in projects. Projects come in many forms, often taking considerable time and consuming a large amount of resources. The management and scheduling of projects represents a challenging task and project performance may have a considerable impact on an organization's competitiveness. This handbook presents state-of-the-art approaches to project management and scheduling. More than sixty contributions written by leading experts in the field provide an authoritative survey of recent developments. The book serves as a comprehensive reference, both, for researchers and project management professionals. The handbook consists of two volumes. Volume 1 is devoted to single-modal and multi-modal project scheduling. Volume 2 presents multi-project problems, project scheduling under uncertainty and vagueness, managerial approaches and a separate part on applications, case studies and information systems.
Download or read book Algorithms and Computation written by Khaled Elbassioni and published by Springer. This book was released on 2015-12-07 with total page 793 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 26th International Symposium on Algorithms and Computation, ISAAC 2015, held in Nagoya, Japan, in December 2015. The 65 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 180 submissions for inclusion in the book. The focus of the volume is on the following topics: computational geometry; data structures; combinatorial optimization and approximation algorithms; randomized algorithms; graph algorithms and FPT; computational complexity; graph drawing and planar graphs; online and streaming algorithms; and string and DNA algorithms.
Download or read book Symbolic and Quantitative Approaches to Reasoning with Uncertainty written by Zied Bouraoui and published by Springer Nature. This book was released on 2023-12-20 with total page 481 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 17th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU 2023, held in Arras, France, in September 2023. The 35 full papers presented in this volume were carefully reviewed and selected from 46 submissions. The papers are organized in topical sections about Complexity and Database Theory; Formal Concept Analysis: Theoretical Advances; Formal Concept Analysis: Applications; Modelling and Explanation; Semantic Web and Graphs; Posters.
Download or read book Paradigms of Combinatorial Optimization written by Vangelis Th. Paschos and published by John Wiley & Sons. This book was released on 2014-08-08 with total page 626 pages. Available in PDF, EPUB and Kindle. Book excerpt: Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Download or read book Discrete Optimization written by R. Gary Parker and published by . This book was released on 1983 with total page pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Nonlinear Discrete Optimization written by Shmuel Onn and published by European Mathematical Society. This book was released on 2010 with total page 0 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph develops an algorithmic theory of nonlinear discrete optimization. It introduces a simple and useful setup, which enables the polynomial time solution of broad fundamental classes of nonlinear combinatorial optimization and integer programming problems in variable dimension. An important part of this theory is enhanced by recent developments in the algebra of Graver bases. The power of the theory is demonstrated by deriving the first polynomial time algorithms in a variety of application areas within operations research and statistics, including vector partitioning, matroid optimization, experimental design, multicommodity flows, multi-index transportation and privacy in statistical databases. This monograph is intended for graduate students and researchers. It is accessible to anyone with standard undergraduate knowledge and mathematical maturity.
Download or read book Parallel Processing of Discrete Optimization Problems written by Panos M. Pardalos and published by American Mathematical Soc.. This book was released on 1995-01-01 with total page 392 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book contains papers presented at the Workshop on Parallel Processing of Discrete Optimization Problems held at DIMACS in April 1994. The contents cover a wide spectrum of the most recent algorithms and applications in parallel processing of discrete optimization and related problems. Topics include parallel branch and bound algorithms, scalability, load balancing, parallelism and irregular data structures and scheduling task graphs on parallel machines. Applications include parallel algorithms for solving satisfiability problems, location problems, linear programming, quadratic and linear assignment problems. This book would be suitable as a textbook in advanced courses on parallel algorithms and combinatorial optimization.
Download or read book Combinatorial Optimization and Applications written by Peter Widmayer and published by Springer. This book was released on 2013-11-21 with total page 432 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the 7th International Conference on Combinatorial Optimization and Applications, COCOA 2013, held in Chengdu, China, in December 2013. The 36 full papers presented were carefully reviewed and selected from 72 submissions. The papers feature original research in the areas of combinatorial optimization and its applications. In addition to theoretical results there are reports on experimental and applied research of general algorithmic interest.
Download or read book Optimization and Logistics Challenges in the Enterprise written by Wanpracha Chaovalitwongse and published by Springer Science & Business Media. This book was released on 2009-06-17 with total page 434 pages. Available in PDF, EPUB and Kindle. Book excerpt: In a world with highly competitive markets and economic instability due to capitalization, industrial competition has increasingly intensified. In order for many industries to survive and succeed, they need to develop highly effective coordination between supply chain partners, dynamic collaborative and strategic alliance relationships, and efficient logistics and supply chain network designs. Consequently, in the past decade, there has been an explosion of interest among academic researchers and industrial practitioners in innovative supply chain and logistics models, algorithms, and coordination policies. Mathematically distinct from classical supply chain management, this emerging research area has been proven to be useful and applicable to a wide variety of industries. This book brings together recent advances in supply chain and logistics research and computational optimization that apply to a collaborative environment in the enterprise.
Download or read book Algorithmic Decision Theory written by Francesca Rossi and published by Springer Science & Business Media. This book was released on 2009-10-05 with total page 471 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains the papers presented at ADT 2009, the first International Conference on Algorithmic Decision Theory. The conference was held in San Servolo, a small island of the Venice lagoon, during October 20-23, 2009. The program of the conference included oral presentations, posters, invited talks, and tutorials. The conference received 65 submissions of which 39 papers were accepted (9 papers were posters). The topics of these papers range from computational social choice preference modeling, from uncertainty to preference learning, from multi-criteria decision making to game theory.
