Download or read book Multiple Criteria Decision Making in the New Millennium written by Murat Köksalan and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 478 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume contains a collection of papers presented at the 15th International Conference on Multiple Criteria Decision Making held in Ankara, Turkey July 10 14, 2000. This was one of the regular conferences of the International Society on Multiple Criteria Decision Making, which are held at approximately two-year intervals. The Ankara conference had 195 participants from 38 countries. A total of 185 papers were presented at the conference. The title of our volume is MCDM in the New Millennium. The papers presented at the conference reflect the theme. We had several papers on information technology (IT) and many application papers. Of the 81 application papers presented, 14 appear in the volume. We expect more IT applications of MCDM to appear in the future, in particular in the areas of e-commerce and the internet. The conference surroundings and accomodations were excellent, and conducive to both an outstanding academic exchange, and enjoyment and a cultural broadening of participants. We had a pleasant and enjoyable outing and visit to the Anatolian Civilizations Museum. We also had an outstanding banquet at which awards were presented. The MCDM Gold Medal was presented to Professor Thomas Saaty, of the University of Pittsburgh. The MCDM Presidential Service Award was presented to ProfessorPekka Korhonen of the Helsinki School of Economics for his years of presidential service to the society. The society presented the MCDM Edgeworth-Pareto Award to Professor Alexander V. Lotov of the Russian Academy of Sciences.

Download or read book Evolutionary Multi Criterion Optimization written by Carlos M. Fonseca and published by Springer Science & Business Media. This book was released on 2003-04-07 with total page 825 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the Second International Conference on Evolutionary Multi-Criterion Optimization, EMO 2003, held in Faro, Portugal, in April 2003. The 56 revised full papers presented were carefully reviewed and selected from a total of 100 submissions. The papers are organized in topical sections on objective handling and problem decomposition, algorithm improvements, online adaptation, problem construction, performance analysis and comparison, alternative methods, implementation, and applications.

Download or read book African Doctorates in Mathematics written by and published by Lulu.com. This book was released on 2007 with total page 385 pages. Available in PDF, EPUB and Kindle. Book excerpt: This volume presents a catalogue of over 2000 doctoral theses by Africans in all fields of mathematics, including applied mathematics, mathematics education and history of mathematics. The introduction contains information about distribution by country, institutions, period, and by gender, about mathematical density, and mobility of mathematicians. Several appendices are included (female doctorate holders, doctorates in mathematics education, doctorates awarded by African universities to non-Africans, doctoral theses by non-Africans about mathematics in Africa, activities of African mathematicians at the service of their communities). Paulus Gerdes compiled the information in his capacity of Chairman of the African Mathematical Union Commission for the History of Mathematics in Africa (AMUCHMA). The book contains a preface by Mohamed Hassan, President of the African Academy of Sciences (AAS) and Executive Director of the Academy of Sciences for the Developing World (TWAS). (383 pp.)

Download or read book Semi Infinite Programming written by Rembert Reemtsen and published by Springer Science & Business Media. This book was released on 2013-03-14 with total page 418 pages. Available in PDF, EPUB and Kindle. Book excerpt: Semi-infinite programming (briefly: SIP) is an exciting part of mathematical programming. SIP problems include finitely many variables and, in contrast to finite optimization problems, infinitely many inequality constraints. Prob lems of this type naturally arise in approximation theory, optimal control, and at numerous engineering applications where the model contains at least one inequality constraint for each value of a parameter and the parameter, repre senting time, space, frequency etc., varies in a given domain. The treatment of such problems requires particular theoretical and numerical techniques. The theory in SIP as well as the number of numerical SIP methods and appli cations have expanded very fast during the last years. Therefore, the main goal of this monograph is to provide a collection of tutorial and survey type articles which represent a substantial part of the contemporary body of knowledge in SIP. We are glad that leading researchers have contributed to this volume and that their articles are covering a wide range of important topics in this subject. It is our hope that both experienced students and scientists will be well advised to consult this volume. We got the idea for this volume when we were organizing the semi-infinite pro gramming workshop which was held in Cottbus, Germany, in September 1996.

Download or read book Operations Research in the Airline Industry written by Gang Yu and published by Springer Science & Business Media. This book was released on 1997-12-31 with total page 514 pages. Available in PDF, EPUB and Kindle. Book excerpt: 260 2 Crew Legalities and Crew Pairing Repair 264 3 Model and Mathematical Formulation 266 4 Solution Methodology 271 5 Computational Experiences 277 6 Conclusion 285 REFERENCES 286 10 THE USE OF OPTIMIZATION TO PERFORM AIR TRAFFIC FLOW MANAGEMENT Kenneth Lindsay, E. Andrew Boyd, George Booth, and Charles Harvey 287 1 Introduction 288 2 The Traffic Flow Management (TFM) Problem 289 3 Recent TFM Optimization Models 292 4 The Time Assignment Model (TAM) 302 5 Summary and Conclusions 307 REFERENCES 309 11 THE PROCESSES OF AIRLINE SYSTEM OPERATIONS CONTROL Seth C. Grandeau, Michael D. Clarke, and Dennis F.X. Mathaisel 312 1 Introduction 313 2 The Four Phases of Airline Schedule Development 315 The Airline Operations Control Center (OCC) 3 320 4 Analysis of Operational Problems 331 5 Areas For Improvement 352 6 Case Study: PT Garuda Indonesia Airlines 357 REFERENCES 368 12 THE COMPLEX CONFIGURATION MODEL Bruce W. Patty and Jim Diamond 370 1 Introduction 370 Problem Description 2 371 Problem Formulation 3 375 4 Model Implementation 379 ix Contents 383 5 Summary REFERENCES 383 13 INTEGRATED AIRLINE SCHEDULE PLANNING Cynthia Barnhart, Fang Lu, and Rajesh Shenoi 384 1 Introduction 385 2 Fleet Assignment and Crew Pairing Problems: Existing M- els and Algorithms 388 3 An Integrated Approximate Fleet Assignment and Crew Pa- ing Model 393 4 An Advanced Integrated Solution Approach 395 5 Case Study 396 6 Conclusions and Future Research Directions 399 REFERENCES 401 14 AIRLINE SCHEDULE PERTURBATION PROBLEM: LANDING AND TAKEOFF WITH

Download or read book The Development of the Number Field Sieve written by Arjen K. Lenstra and published by Springer. This book was released on 2006-11-15 with total page 138 pages. Available in PDF, EPUB and Kindle. Book excerpt: The number field sieve is an algorithm for finding the prime factors of large integers. It depends on algebraic number theory. Proposed by John Pollard in 1988, the method was used in 1990 to factor the ninth Fermat number, a 155-digit integer. The algorithm is most suited to numbers of a special form, but there is a promising variant that applies in general. This volume contains six research papers that describe the operation of the number field sieve, from both theoretical and practical perspectives. Pollard's original manuscript is included. In addition, there is an annotated bibliography of directly related literature.

Download or read book Applications of Stochastic Programming written by Stein W. Wallace and published by SIAM. This book was released on 2005-01-01 with total page 724 pages. Available in PDF, EPUB and Kindle. Book excerpt: Consisting of two parts, this book presents papers describing publicly available stochastic programming systems that are operational. It presents a diverse collection of application papers in areas such as production, supply chain and scheduling, gaming, environmental and pollution control, financial modeling, telecommunications, and electricity.

Download or read book Geometric Properties of Banach Spaces and Nonlinear Iterations written by Charles Chidume and published by Springer Science & Business Media. This book was released on 2009-03-27 with total page 337 pages. Available in PDF, EPUB and Kindle. Book excerpt: The contents of this monograph fall within the general area of nonlinear functional analysis and applications. We focus on an important topic within this area: geometric properties of Banach spaces and nonlinear iterations, a topic of intensive research e?orts, especially within the past 30 years, or so. In this theory, some geometric properties of Banach spaces play a crucial role. In the ?rst part of the monograph, we expose these geometric properties most of which are well known. As is well known, among all in?nite dim- sional Banach spaces, Hilbert spaces have the nicest geometric properties. The availability of the inner product, the fact that the proximity map or nearest point map of a real Hilbert space H onto a closed convex subset K of H is Lipschitzian with constant 1, and the following two identities 2 2 2 ||x+y|| =||x|| +2 x,y +||y|| , (?) 2 2 2 2 ||?x+(1??)y|| = ?||x|| +(1??)||y|| ??(1??)||x?y|| , (??) which hold for all x,y? H, are some of the geometric properties that char- terize inner product spaces and also make certain problems posed in Hilbert spaces more manageable than those in general Banach spaces. However, as has been rightly observed by M. Hazewinkel, “... many, and probably most, mathematical objects and models do not naturally live in Hilbert spaces”. Consequently,toextendsomeoftheHilbertspacetechniquestomoregeneral Banach spaces, analogues of the identities (?) and (??) have to be developed.

Download or read book Particle Modeling written by Donald Greenspan and published by Springer Science & Business Media. This book was released on 1997-09-23 with total page 292 pages. Available in PDF, EPUB and Kindle. Book excerpt: A reference for the field of particle modelling - the study of dynamical behaviour of solids and fluids in response to external forces, with the solids and fluids modelled as systems of atoms and molecules.

Download or read book CIKM 13 written by CIKM 13 Conference Committee and published by . This book was released on 2013-10-27 with total page 938 pages. Available in PDF, EPUB and Kindle. Book excerpt: CIKM'13: 22nd ACM International Conference on Information and Knowledge Management Oct 27, 2013-Nov 01, 2013 San Francisco, USA. You can view more information about this proceeding and all of ACM�s other published conference proceedings from the ACM Digital Library: http://www.acm.org/dl.

Download or read book Foundations of Constraint Satisfaction written by Edward Tsang and published by BoD – Books on Demand. This book was released on 2014-05-13 with total page 446 pages. Available in PDF, EPUB and Kindle. Book excerpt: This seminal text of Computer Science, the most cited book on the subject, is now available for the first time in paperback. Constraint satisfaction is a decision problem that involves finite choices. It is ubiquitous. The goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many applications in artificial intelligence, and has found its application in many areas, such as planning and scheduling. Because of its generality, most AI researchers should be able to benefit from having good knowledge of techniques in this field. Originally published in 1993, this now classic book was the first attempt to define the scope of constraint satisfaction. It covers both the theoretical and the implementation aspects of the subject. It provides a framework for studying this field, relates different research, and resolves ambiguity in a number of concepts and algorithms in the literature. This seminal text is arguably the most rigorous book in the field. All major concepts were defined in First Order Predicate Calculus. Concepts defined this way are precise and unambiguous.

Download or read book Sampling in Combinatorial and Geometric Set Systems written by Nabil H. Mustafa and published by American Mathematical Society. This book was released on 2022-01-14 with total page 251 pages. Available in PDF, EPUB and Kindle. Book excerpt: Understanding the behavior of basic sampling techniques and intrinsic geometric attributes of data is an invaluable skill that is in high demand for both graduate students and researchers in mathematics, machine learning, and theoretical computer science. The last ten years have seen significant progress in this area, with many open problems having been resolved during this time. These include optimal lower bounds for epsilon-nets for many geometric set systems, the use of shallow-cell complexity to unify proofs, simpler and more efficient algorithms, and the use of epsilon-approximations for construction of coresets, to name a few. This book presents a thorough treatment of these probabilistic, combinatorial, and geometric methods, as well as their combinatorial and algorithmic applications. It also revisits classical results, but with new and more elegant proofs. While mathematical maturity will certainly help in appreciating the ideas presented here, only a basic familiarity with discrete mathematics, probability, and combinatorics is required to understand the material.

Download or read book Graph Decompositions written by Reinhard Diestel and published by Oxford Science Publications. This book was released on 1990 with total page 258 pages. Available in PDF, EPUB and Kindle. Book excerpt: Graph Decompositions is the first book on a topic that belongs mainly to infinite graph theory. It offers a complete account of the theory of simplicial decompositions of graphs, from its origins in the 1930s right up to present-day research.In addition to being one of the most important tools in infinite graph theory, simplicial decompositions may be seen as a model for any kind of structural graph decomposition. The currently topical tree-decompositions, for example, have their origin in simplicial decompositions.The text is centred around a few guiding problems and concepts, such as the existence and the uniqueness problem of simplicial decompositions into primes, or the concept of excluded minors as a means of identifying a desired structure.It attempts to give as authentic a picture as possible ofresearch in progress. To this end, it includes discussions of examples, proof strategies on the formation of new concepts, as well as numerous exercises and open problems.Graph Decompositions should prove attractive to any graph theorist or other mathematician interested in a new area of research, as well as to the advanced student looking for a lively and inspiring account of how such research evolves.

Download or read book Complexity and Approximation written by Giorgio Ausiello and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 536 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book documents the state of the art in combinatorial optimization, presenting approximate solutions of virtually all relevant classes of NP-hard optimization problems. The wealth of problems, algorithms, results, and techniques make it an indispensible source of reference for professionals. The text smoothly integrates numerous illustrations, examples, and exercises.

Download or read book Multiobjective Optimization written by Jürgen Branke and published by Springer. This book was released on 2008-10-18 with total page 481 pages. Available in PDF, EPUB and Kindle. Book excerpt: Multiobjective optimization deals with solving problems having not only one, but multiple, often conflicting, criteria. Such problems can arise in practically every field of science, engineering and business, and the need for efficient and reliable solution methods is increasing. The task is challenging due to the fact that, instead of a single optimal solution, multiobjective optimization results in a number of solutions with different trade-offs among criteria, also known as Pareto optimal or efficient solutions. Hence, a decision maker is needed to provide additional preference information and to identify the most satisfactory solution. Depending on the paradigm used, such information may be introduced before, during, or after the optimization process. Clearly, research and application in multiobjective optimization involve expertise in optimization as well as in decision support. This state-of-the-art survey originates from the International Seminar on Practical Approaches to Multiobjective Optimization, held in Dagstuhl Castle, Germany, in December 2006, which brought together leading experts from various contemporary multiobjective optimization fields, including evolutionary multiobjective optimization (EMO), multiple criteria decision making (MCDM) and multiple criteria decision aiding (MCDA). This book gives a unique and detailed account of the current status of research and applications in the field of multiobjective optimization. It contains 16 chapters grouped in the following 5 thematic sections: Basics on Multiobjective Optimization; Recent Interactive and Preference-Based Approaches; Visualization of Solutions; Modelling, Implementation and Applications; and Quality Assessment, Learning, and Future Challenges.

Download or read book Optimisation multiobjectif written by Yann Collette and published by Editions Eyrolles. This book was released on 2011-07-07 with total page 294 pages. Available in PDF, EPUB and Kindle. Book excerpt: L'optimisation multiobjectif et ses applications Les ingénieurs se heurtent quotidiennement, quel que soit leur secteur d'activité, à des problèmes d'optimisation. Il peut s'agir de minimiser un coût de production, d'optimiser le parcours d'un véhicule, d'améliorer les performances d'un circuit électronique, d'affiner un modèle de calcul, de fournir une aide à la décision à des managers, etc. On parle d'optimisation multiobjectif dans les cas complexes où l'on doit optimiser simultanément plusieurs objectifs contradictoires, ce qui amène à choisir une solution de compromis parmi une multitude de solutions possibles. Un ouvrage de référence illustré d'études de cas Destiné à tous les ingénieurs confrontés à des problèmes d'optimisation, ainsi qu'aux spécialistes en recherche opérationnelle et en aide à la décision, cet ouvrage présente dans une première partie les principes de l'optimisation multiobjectif en décrivant toutes les méthodes permettant de résoudre ce type de problème. La deuxième partie explique comment évaluer les performances de ces méthodes et choisir la méthode la mieux adaptée à un problème donné. La dernière partie propose trois études de cas réels : optimisation de la simulation numérique d'un processus industriel (CEA), dimensionnement d'un réseau de télécommunication (France Télécom R&D), outil d'aide à la décision pour le traitement d'appels d'offres (EADS). A qui s'adresse le livre ? Aux élèves ingénieurs et étudiants en mathématiques appliquées, algorithmique, sciences de l'ingénieur (électronique, automatique, mécanique), économie (recherche opérationnelle), etc. Aux ingénieurs, enseignants-chercheurs, informaticiens, industriels, économistes et décideurs ayant à résoudre des problèmes complexes d'optimisation ou d'aide à la décision.

Download or read book Approximation and Complexity in Numerical Optimization written by Panos M. Pardalos and published by Springer Science & Business Media. This book was released on 2013-06-29 with total page 597 pages. Available in PDF, EPUB and Kindle. Book excerpt: There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. In discrete (or combinatorial) optimization many approaches have been developed recently that link the discrete universe to the continuous universe through geomet ric, analytic, and algebraic techniques. Such techniques include global optimization formulations, semidefinite programming, and spectral theory. As a result new ap proximate algorithms have been discovered and many new computational approaches have been developed. Similarly, for many continuous nonconvex optimization prob lems, new approximate algorithms have been developed based on semidefinite pro gramming and new randomization techniques. On the other hand, computational complexity, originating from the interactions between computer science and numeri cal 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. A conference on Approximation and Complexity in Numerical Optimization: Con tinuous and Discrete Problems was held during February 28 to March 2, 1999 at the Center for Applied Optimization of the University of Florida.