Author: C. Kastning
Publisher: Springer Science & Business Media
ISBN: 3662022842
Category : Business & Economics
Languages : en
Pages : 504
Book Description
Integer Prograw~ing is one of the most fascinating and difficult areas in the field of Mathematical Optimization. Due to this fact notable research contributions to Integer Programming have been made in very different branches of mathematics and its applications. Since these publications are scattered over many journals, proceedings volumes, monographs, and working papers, a comprehensive bibliography of all these sources is a helpful tool even for specialists in this field. I initiated this compilation of literature in 1970 at the Institut fur ~konometrie und Operations Research, University of Bonn. Since then many collaborators have contributed to and worked on it. Among them Dipl.-Math. Claus Kastning has done the bulk of the work. With great perseverance and diligence he has gathered all the material and checked it with the original sources. The main aim was to incorporate rare and not easily accessible sources like Russian journals, preprints or unpublished papers. Without the invaluable and dedicated engagement of Claus Kastning the bibliography would never have reached this final version. For this reason he must be considered its responsible editor. As with any other collection this literature list has a subjective viewpoint and may be in some sense incomplete. We have however tried to be as complete as possible. The bibliography contains 4704 different publications by 6767 authors which were classified by 11839 descriptor entries.
Integer Programming and Related Areas
Author: C. Kastning
Publisher: Springer Science & Business Media
ISBN: 3662022842
Category : Business & Economics
Languages : en
Pages : 504
Book Description
Integer Prograw~ing is one of the most fascinating and difficult areas in the field of Mathematical Optimization. Due to this fact notable research contributions to Integer Programming have been made in very different branches of mathematics and its applications. Since these publications are scattered over many journals, proceedings volumes, monographs, and working papers, a comprehensive bibliography of all these sources is a helpful tool even for specialists in this field. I initiated this compilation of literature in 1970 at the Institut fur ~konometrie und Operations Research, University of Bonn. Since then many collaborators have contributed to and worked on it. Among them Dipl.-Math. Claus Kastning has done the bulk of the work. With great perseverance and diligence he has gathered all the material and checked it with the original sources. The main aim was to incorporate rare and not easily accessible sources like Russian journals, preprints or unpublished papers. Without the invaluable and dedicated engagement of Claus Kastning the bibliography would never have reached this final version. For this reason he must be considered its responsible editor. As with any other collection this literature list has a subjective viewpoint and may be in some sense incomplete. We have however tried to be as complete as possible. The bibliography contains 4704 different publications by 6767 authors which were classified by 11839 descriptor entries.
Publisher: Springer Science & Business Media
ISBN: 3662022842
Category : Business & Economics
Languages : en
Pages : 504
Book Description
Integer Prograw~ing is one of the most fascinating and difficult areas in the field of Mathematical Optimization. Due to this fact notable research contributions to Integer Programming have been made in very different branches of mathematics and its applications. Since these publications are scattered over many journals, proceedings volumes, monographs, and working papers, a comprehensive bibliography of all these sources is a helpful tool even for specialists in this field. I initiated this compilation of literature in 1970 at the Institut fur ~konometrie und Operations Research, University of Bonn. Since then many collaborators have contributed to and worked on it. Among them Dipl.-Math. Claus Kastning has done the bulk of the work. With great perseverance and diligence he has gathered all the material and checked it with the original sources. The main aim was to incorporate rare and not easily accessible sources like Russian journals, preprints or unpublished papers. Without the invaluable and dedicated engagement of Claus Kastning the bibliography would never have reached this final version. For this reason he must be considered its responsible editor. As with any other collection this literature list has a subjective viewpoint and may be in some sense incomplete. We have however tried to be as complete as possible. The bibliography contains 4704 different publications by 6767 authors which were classified by 11839 descriptor entries.
Boolean Methods in Operations Research and Related Areas
Author: P. L. Hammer
Publisher: Springer Science & Business Media
ISBN: 3642858236
Category : Business & Economics
Languages : en
Pages : 343
Book Description
In classical analysis, there is a vast difference between the class of problems that may be handled by means of the methods of calculus and the class of problems requiring combinatorial techniques. With the advent of the digital computer, the distinction begins to blur, and with the increasing emphasis on problems involving optimization over structures, tIlE' distinction vanishes. What is necessary for the analytic and computational treatment of significant questions arising in modern control theory, mathematical economics, scheduling theory, operations research, bioengineering, and so forth is a new and more flexible mathematical theory which subsumes both the cla8sical continuous and discrete t 19orithms. The work by HAMMER (IVANESCU) and RUDEANU on Boolean methods represents an important step in this dnectlOn, and it is thus a great pleasure to welcome it into print. It will certainly stimulate a great deal of additional research in both theory and application. RICHARD BELLMAN University of Southern California FOf(,WOl'
Publisher: Springer Science & Business Media
ISBN: 3642858236
Category : Business & Economics
Languages : en
Pages : 343
Book Description
In classical analysis, there is a vast difference between the class of problems that may be handled by means of the methods of calculus and the class of problems requiring combinatorial techniques. With the advent of the digital computer, the distinction begins to blur, and with the increasing emphasis on problems involving optimization over structures, tIlE' distinction vanishes. What is necessary for the analytic and computational treatment of significant questions arising in modern control theory, mathematical economics, scheduling theory, operations research, bioengineering, and so forth is a new and more flexible mathematical theory which subsumes both the cla8sical continuous and discrete t 19orithms. The work by HAMMER (IVANESCU) and RUDEANU on Boolean methods represents an important step in this dnectlOn, and it is thus a great pleasure to welcome it into print. It will certainly stimulate a great deal of additional research in both theory and application. RICHARD BELLMAN University of Southern California FOf(,WOl'
Handbook of Satisfiability
Author: A. Biere
Publisher: IOS Press
ISBN: 1643681613
Category : Computers
Languages : en
Pages : 1486
Book Description
Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"
Publisher: IOS Press
ISBN: 1643681613
Category : Computers
Languages : en
Pages : 1486
Book Description
Propositional logic has been recognized throughout the centuries as one of the cornerstones of reasoning in philosophy and mathematics. Over time, its formalization into Boolean algebra was accompanied by the recognition that a wide range of combinatorial problems can be expressed as propositional satisfiability (SAT) problems. Because of this dual role, SAT developed into a mature, multi-faceted scientific discipline, and from the earliest days of computing a search was underway to discover how to solve SAT problems in an automated fashion. This book, the Handbook of Satisfiability, is the second, updated and revised edition of the book first published in 2009 under the same name. The handbook aims to capture the full breadth and depth of SAT and to bring together significant progress and advances in automated solving. Topics covered span practical and theoretical research on SAT and its applications and include search algorithms, heuristics, analysis of algorithms, hard instances, randomized formulae, problem encodings, industrial applications, solvers, simplifiers, tools, case studies and empirical results. SAT is interpreted in a broad sense, so as well as propositional satisfiability, there are chapters covering the domain of quantified Boolean formulae (QBF), constraints programming techniques (CSP) for word-level problems and their propositional encoding, and satisfiability modulo theories (SMT). An extensive bibliography completes each chapter. This second edition of the handbook will be of interest to researchers, graduate students, final-year undergraduates, and practitioners using or contributing to SAT, and will provide both an inspiration and a rich resource for their work. Edmund Clarke, 2007 ACM Turing Award Recipient: "SAT solving is a key technology for 21st century computer science." Donald Knuth, 1974 ACM Turing Award Recipient: "SAT is evidently a killer app, because it is key to the solution of so many other problems." Stephen Cook, 1982 ACM Turing Award Recipient: "The SAT problem is at the core of arguably the most fundamental question in computer science: What makes a problem hard?"
Operations Research ’93
Author: Achim Bachem
Publisher: Springer Science & Business Media
ISBN: 3642469558
Category : Business & Economics
Languages : en
Pages : 574
Book Description
This proceedings volume contains extended abstracts of talks presented at the 18th Symposium on Operations Research held at the University of Cologne, September 1-3, 1993. The Symposia on Operations Research are the annual meetings of the Gesellschaft fiir Mathematik, Okonometrie und Operations Research (GMOOR), a scientific society providing a link between research and applications in the areas of applied mathematics, economics and operations research. The broad range of interests and scientific activities covered by GMOOR and its members was demonstrated by about 250 talks presented at the 18th Symposium. As in l'ecent years, emphasis was placed on optimization and stochastics, this year with a special focus on combinatorial optimization and discrete mathematics. We appreciate that with sections on parallel and distributed computing and on scientific computing also new fields could be integrated into the scope of the GMOOR. This book contains extended abstracts of most of the papers presented at the con ference. Long versions and full papers of the talks are expected to appear elsewhere in refereed periodicals. The contributions were divided into sixteen sections: (1) Theory of Optimization, (2) Computational Methods of Optimization, (3) Combinatorial Optimization and Dis crete Mathematics, (4) Scientific Computing, (5) Decision Theory, (6) Mathematical Economics and Game Theory, (7) Banking, Finance and Insurance, (8) Econometrics, (9) Macroeconomics and Economic Theory, (10) Stochastics, (11) Production and Lo gistics, (12) System and Control Theory, (13) Routing and Scheduling, (14) Knowledge Based Systems, (15) Information Systems and (16) Parallel and Distributed Compu ting.
Publisher: Springer Science & Business Media
ISBN: 3642469558
Category : Business & Economics
Languages : en
Pages : 574
Book Description
This proceedings volume contains extended abstracts of talks presented at the 18th Symposium on Operations Research held at the University of Cologne, September 1-3, 1993. The Symposia on Operations Research are the annual meetings of the Gesellschaft fiir Mathematik, Okonometrie und Operations Research (GMOOR), a scientific society providing a link between research and applications in the areas of applied mathematics, economics and operations research. The broad range of interests and scientific activities covered by GMOOR and its members was demonstrated by about 250 talks presented at the 18th Symposium. As in l'ecent years, emphasis was placed on optimization and stochastics, this year with a special focus on combinatorial optimization and discrete mathematics. We appreciate that with sections on parallel and distributed computing and on scientific computing also new fields could be integrated into the scope of the GMOOR. This book contains extended abstracts of most of the papers presented at the con ference. Long versions and full papers of the talks are expected to appear elsewhere in refereed periodicals. The contributions were divided into sixteen sections: (1) Theory of Optimization, (2) Computational Methods of Optimization, (3) Combinatorial Optimization and Dis crete Mathematics, (4) Scientific Computing, (5) Decision Theory, (6) Mathematical Economics and Game Theory, (7) Banking, Finance and Insurance, (8) Econometrics, (9) Macroeconomics and Economic Theory, (10) Stochastics, (11) Production and Lo gistics, (12) System and Control Theory, (13) Routing and Scheduling, (14) Knowledge Based Systems, (15) Information Systems and (16) Parallel and Distributed Compu ting.
Clusters, Orders, and Trees: Methods and Applications
Author: Fuad Aleskerov
Publisher: Springer
ISBN: 1493907425
Category : Mathematics
Languages : en
Pages : 404
Book Description
The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings and hierarchies—in multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted in Mirkin’s fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining and knowledge discovery. Researchers, students and software engineers will benefit from new knowledge discovery techniques and application directions.
Publisher: Springer
ISBN: 1493907425
Category : Mathematics
Languages : en
Pages : 404
Book Description
The volume is dedicated to Boris Mirkin on the occasion of his 70th birthday. In addition to his startling PhD results in abstract automata theory, Mirkin’s ground breaking contributions in various fields of decision making and data analysis have marked the fourth quarter of the 20th century and beyond. Mirkin has done pioneering work in group choice, clustering, data mining and knowledge discovery aimed at finding and describing non-trivial or hidden structures—first of all, clusters, orderings and hierarchies—in multivariate and/or network data. This volume contains a collection of papers reflecting recent developments rooted in Mirkin’s fundamental contribution to the state-of-the-art in group choice, ordering, clustering, data mining and knowledge discovery. Researchers, students and software engineers will benefit from new knowledge discovery techniques and application directions.
A Boole Anthology
Author: James Gasser
Publisher: Springer Science & Business Media
ISBN: 940159385X
Category : Philosophy
Languages : en
Pages : 351
Book Description
Modern mathematical logic would not exist without the analytical tools first developed by George Boole in The Mathematical Analysis of Logic and The Laws of Thought. The influence of the Boolean school on the development of logic, always recognised but long underestimated, has recently become a major research topic. This collection is the first anthology of works on Boole. It contains two works published in 1865, the year of Boole's death, but never reprinted, as well as several classic studies of recent decades and ten original contributions appearing here for the first time. From the programme of the English Algebraic School to Boole's use of operator methods, from the problem of interpretability to that of psychologism, a full range of issues is covered. The Boole Anthology is indispensable to Boole studies and will remain so for years to come.
Publisher: Springer Science & Business Media
ISBN: 940159385X
Category : Philosophy
Languages : en
Pages : 351
Book Description
Modern mathematical logic would not exist without the analytical tools first developed by George Boole in The Mathematical Analysis of Logic and The Laws of Thought. The influence of the Boolean school on the development of logic, always recognised but long underestimated, has recently become a major research topic. This collection is the first anthology of works on Boole. It contains two works published in 1865, the year of Boole's death, but never reprinted, as well as several classic studies of recent decades and ten original contributions appearing here for the first time. From the programme of the English Algebraic School to Boole's use of operator methods, from the problem of interpretability to that of psychologism, a full range of issues is covered. The Boole Anthology is indispensable to Boole studies and will remain so for years to come.
Mining Modelling
Author: V. Ehrenberger
Publisher: Elsevier
ISBN: 0444597441
Category : Technology & Engineering
Languages : en
Pages : 217
Book Description
The main aim of this book is to offer an exposition of the principles and applications of an original method which was introduced by the authors, developed gradually in the course of time, and applied extensively in the most diverse fields of management in the mining industry and power engineering. It is a relatively universal method of mathematical model construction and application intended to aid managerial personnel at various management levels in decision-making situations, which are frequently characterized by complicated relations of a quantitative as well as logical character.The method, called by the authors simply the ``method of mathematical-logical modelling'' (MLM for short), is based upon an interesting and effective combination of tools from mathematical logic, Boolean algebra and computer programming. From the mathematical point of view it is based primarily on the construction and solution of systems of pseudo-Boolean equations and inequalities with a generalized logical structure. The principal features of the method are its universality, iterativity, interactivity, and advanced and broadly applicable software, coded in FORTRAN 77. Due in particular to these properties, MLM is a powerful tool for modelling real-life situations in the mining industry (and, naturally, in other fields of human activity as well).The exposition is illustrated by a considerable number of examples. Some of these are rather simple and aimed at helping the reader verify his correct understanding of the text. Other examples, especially in the second part of the book (Chapters 6, 7 and 8), are more complicated and extensive. In some instances they have the character of case studies and demonstrate typical approaches applied when modelling mining situations.The book will be of interest to a broad range of specialists working in the mining industry - research workers, designers, computer personnel, system analysts, management personnel at all managerial levels, and also undergraduate as well as graduate students.
Publisher: Elsevier
ISBN: 0444597441
Category : Technology & Engineering
Languages : en
Pages : 217
Book Description
The main aim of this book is to offer an exposition of the principles and applications of an original method which was introduced by the authors, developed gradually in the course of time, and applied extensively in the most diverse fields of management in the mining industry and power engineering. It is a relatively universal method of mathematical model construction and application intended to aid managerial personnel at various management levels in decision-making situations, which are frequently characterized by complicated relations of a quantitative as well as logical character.The method, called by the authors simply the ``method of mathematical-logical modelling'' (MLM for short), is based upon an interesting and effective combination of tools from mathematical logic, Boolean algebra and computer programming. From the mathematical point of view it is based primarily on the construction and solution of systems of pseudo-Boolean equations and inequalities with a generalized logical structure. The principal features of the method are its universality, iterativity, interactivity, and advanced and broadly applicable software, coded in FORTRAN 77. Due in particular to these properties, MLM is a powerful tool for modelling real-life situations in the mining industry (and, naturally, in other fields of human activity as well).The exposition is illustrated by a considerable number of examples. Some of these are rather simple and aimed at helping the reader verify his correct understanding of the text. Other examples, especially in the second part of the book (Chapters 6, 7 and 8), are more complicated and extensive. In some instances they have the character of case studies and demonstrate typical approaches applied when modelling mining situations.The book will be of interest to a broad range of specialists working in the mining industry - research workers, designers, computer personnel, system analysts, management personnel at all managerial levels, and also undergraduate as well as graduate students.
The Best of ICCAD
Author: Andreas Kuehlmann
Publisher: Springer Science & Business Media
ISBN: 1461502926
Category : Computers
Languages : en
Pages : 699
Book Description
In 2002, the International Conference on Computer Aided Design (ICCAD) celebrates its 20th anniversary. This book commemorates contributions made by ICCAD to the broad field of design automation during that time. The foundation of ICCAD in 1982 coincided with the growth of Large Scale Integration. The sharply increased functionality of board-level circuits led to a major demand for more powerful Electronic Design Automation (EDA) tools. At the same time, LSI grew quickly and advanced circuit integration became widely avail able. This, in turn, required new tools, using sophisticated modeling, analysis and optimization algorithms in order to manage the evermore complex design processes. Not surprisingly, during the same period, a number of start-up com panies began to commercialize EDA solutions, complementing various existing in-house efforts. The overall increased interest in Design Automation (DA) re quired a new forum for the emerging community of EDA professionals; one which would be focused on the publication of high-quality research results and provide a structure for the exchange of ideas on a broad scale. Many of the original ICCAD volunteers were also members of CANDE (Computer-Aided Network Design), a workshop of the IEEE Circuits and Sys tem Society. In fact, it was at a CANDE workshop that Bill McCalla suggested the creation of a conference for the EDA professional. (Bill later developed the name).
Publisher: Springer Science & Business Media
ISBN: 1461502926
Category : Computers
Languages : en
Pages : 699
Book Description
In 2002, the International Conference on Computer Aided Design (ICCAD) celebrates its 20th anniversary. This book commemorates contributions made by ICCAD to the broad field of design automation during that time. The foundation of ICCAD in 1982 coincided with the growth of Large Scale Integration. The sharply increased functionality of board-level circuits led to a major demand for more powerful Electronic Design Automation (EDA) tools. At the same time, LSI grew quickly and advanced circuit integration became widely avail able. This, in turn, required new tools, using sophisticated modeling, analysis and optimization algorithms in order to manage the evermore complex design processes. Not surprisingly, during the same period, a number of start-up com panies began to commercialize EDA solutions, complementing various existing in-house efforts. The overall increased interest in Design Automation (DA) re quired a new forum for the emerging community of EDA professionals; one which would be focused on the publication of high-quality research results and provide a structure for the exchange of ideas on a broad scale. Many of the original ICCAD volunteers were also members of CANDE (Computer-Aided Network Design), a workshop of the IEEE Circuits and Sys tem Society. In fact, it was at a CANDE workshop that Bill McCalla suggested the creation of a conference for the EDA professional. (Bill later developed the name).
Discrete Optimization Algorithms
Author: Maciej M. Sys?o
Publisher: Courier Corporation
ISBN: 0486453537
Category : Computers
Languages : en
Pages : 564
Book Description
Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' derivation and performance characteristics. Subjects include linear and integer programming, packing and covering, optimization on networks, and coloring and scheduling. A familiarity with design, analysis, and use of computer algorithms is assumed, along with knowledge of programming in Pascal. The book can be used as a supporting text in discrete optimization courses or as a software handbook, with twenty-six programs that execute the most common algorithms in each topic area. Each chapter is self-contained, allowing readers to browse at will.
Publisher: Courier Corporation
ISBN: 0486453537
Category : Computers
Languages : en
Pages : 564
Book Description
Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' derivation and performance characteristics. Subjects include linear and integer programming, packing and covering, optimization on networks, and coloring and scheduling. A familiarity with design, analysis, and use of computer algorithms is assumed, along with knowledge of programming in Pascal. The book can be used as a supporting text in discrete optimization courses or as a software handbook, with twenty-six programs that execute the most common algorithms in each topic area. Each chapter is self-contained, allowing readers to browse at will.
Sets and Ordered Structures
Author: Sergiu Rudeanu
Publisher: Bentham Science Publishers
ISBN: 1608053385
Category : Mathematics
Languages : en
Pages : 260
Book Description
This e-book presents several basic methods and results of order theory that are currently used in various branches of mathematics. It presents topics that require a broad explanation in a concise and attractive way. Readers will easily identify problems/t
Publisher: Bentham Science Publishers
ISBN: 1608053385
Category : Mathematics
Languages : en
Pages : 260
Book Description
This e-book presents several basic methods and results of order theory that are currently used in various branches of mathematics. It presents topics that require a broad explanation in a concise and attractive way. Readers will easily identify problems/t