Narrow your search
Listing 1 - 10 of 13 << page
of 2
>>
Sort by
Network optimization : continuous and discrete models
Author:
ISBN: 1886529027 9788865290279 9781886529021 8865290277 Year: 1998 Volume: 8 Publisher: Belmont (MA) : Athena Scientific,

Combinatorial optimization: algorithms and complexity
Authors: ---
ISBN: 0486402584 9780486402581 Year: 1998 Publisher: Mineola, N.Y. Dover

Loading...
Export citation

Choose an application

Bookmark

Abstract

This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further."& American Mathematical Monthly. 1982 ed.

Linear programming : foundations and extensions
Author:
ISBN: 0792381416 0792398041 9780792398042 9780792381419 Year: 1998 Publisher: Boston ; London ; Dordrecht : Kluwer,

Nonlinear Multiobjective Optimization
Author:
ISBN: 0792382781 1461375444 1461555639 9780792382782 Year: 1998 Publisher: New York, NY : Springer US : Imprint: Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

Problems with multiple objectives and criteria are generally known as multiple criteria optimization or multiple criteria decision-making (MCDM) problems. So far, these types of problems have typically been modelled and solved by means of linear programming. However, many real-life phenomena are of a nonlinear nature, which is why we need tools for nonlinear programming capable of handling several conflicting or incommensurable objectives. In this case, methods of traditional single objective optimization and linear programming are not enough; we need new ways of thinking, new concepts, and new methods - nonlinear multiobjective optimization. Nonlinear Multiobjective Optimization provides an extensive, up-to-date, self-contained and consistent survey, review of the literature and of the state of the art on nonlinear (deterministic) multiobjective optimization, its methods, its theory and its background. The amount of literature on multiobjective optimization is immense. The treatment in this book is based on approximately 1500 publications in English printed mainly after the year 1980. Problems related to real-life applications often contain irregularities and nonsmoothnesses. The treatment of nondifferentiable multiobjective optimization in the literature is rather rare. For this reason, this book contains material about the possibilities, background, theory and methods of nondifferentiable multiobjective optimization as well. This book is intended for both researchers and students in the areas of (applied) mathematics, engineering, economics, operations research and management science; it is meant for both professionals and practitioners in many different fields of application. The intention has been to provide a consistent summary that may help in selecting an appropriate method for the problem to be solved. It is hoped the extensive bibliography will be of value to researchers.

Optimization techniques
Author:
ISBN: 0124438628 9786611038373 1281038377 0080551351 9780080551357 9781281038371 9780124438620 Year: 1998 Publisher: San Diego Academic Press

Loading...
Export citation

Choose an application

Bookmark

Abstract

Optimization Techniques is a unique reference source to a diverse array of methods for achieving optimization, and includes both systems structures and computational methods. The text devotes broad coverage toa unified view of optimal learning, orthogonal transformation techniques, sequential constructive techniques, fast back propagation algorithms, techniques for neural networks with nonstationary or dynamic outputs, applications to constraint satisfaction,optimization issues and techniques for unsupervised learning neural networks, optimum Cerebellar Model of Articulation Controller

Integer programming and combinatorial optimization : 6th International IPCO Conference, Houston, Texas, June 22-24, 1998 : proceedings
Authors: --- --- ---
ISSN: 03029743 ISBN: 9783540645900 354064590X 3540693467 Year: 1998 Volume: 1412 Publisher: Berlin, Germany : Springer,

Computational complexity and feasibility of data processing and interval computations
Authors: --- ---
ISBN: 0792348656 144194785X 1475727933 Year: 1998 Volume: 10 Publisher: Dordrecht Kluwer Academic

Loading...
Export citation

Choose an application

Bookmark

Abstract

Targeted audience • Specialists in numerical computations, especially in numerical optimiza­ tion, who are interested in designing algorithms with automatie result ver­ ification, and who would therefore be interested in knowing how general their algorithms caIi in principle be. • Mathematicians and computer scientists who are interested in the theory 0/ computing and computational complexity, especially computational com­ plexity of numerical computations. • Students in applied mathematics and computer science who are interested in computational complexity of different numerical methods and in learning general techniques for estimating this computational complexity. The book is written with all explanations and definitions added, so that it can be used as a graduate level textbook. What this book .is about Data processing. In many real-life situations, we are interested in the value of a physical quantity y that is diflicult (or even impossible) to measure directly. For example, it is impossible to directly measure the amount of oil in an oil field or a distance to a star. Since we cannot measure such quantities directly, we measure them indirectly, by measuring some other quantities Xi and using the known relation between y and Xi'S to reconstruct y. The algorithm that transforms the results Xi of measuring Xi into an estimate fj for y is called data processing.

Keywords

Programming --- Computer science --- Computational complexity --- Numerical calculations --- Interval analysis (Mathematics) --- Complexité de calcul (Informatique) --- Calculs numériques --- Data processing --- Informatique --- Complexité de calcul (Informatique) --- Calculs numériques --- Computer mathematics. --- Computers. --- Mathematical optimization. --- Mathematical models. --- Applied mathematics. --- Engineering mathematics. --- Computational Mathematics and Numerical Analysis. --- Theory of Computation. --- Optimization. --- Mathematical Modeling and Industrial Mathematics. --- Applications of Mathematics. --- Engineering --- Engineering analysis --- Mathematical analysis --- Models, Mathematical --- Simulation methods --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Maxima and minima --- Operations research --- System analysis --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computer mathematics --- Electronic data processing --- Mathematics --- Computational complexity. --- Data processing. --- Analysis, Interval --- Arithmetic, Interval --- Interval arithmetic --- Interval mathematics --- Mathematics, Interval --- Numerical analysis --- Complexity, Computational

Lectures on proof verification and approximation algorithms
Authors: --- ---
ISSN: 03029743 ISBN: 3540642013 9783540642015 3540697012 Year: 1998 Volume: 1367 Publisher: Berlin ; Heidelberg : Springer,

Loading...
Export citation

Choose an application

Bookmark

Abstract

During the last few years, we have seen quite spectacular progress in the area of approximation algorithms: for several fundamental optimization problems we now actually know matching upper and lower bounds for their approximability. This textbook-like tutorial is a coherent and essentially self-contained presentation of the enormous recent progress facilitated by the interplay between the theory of probabilistically checkable proofs and aproximation algorithms. The basic concepts, methods, and results are presented in a unified way to provide a smooth introduction for newcomers. These lectures are particularly useful for advanced courses or reading groups on the topic.

Keywords

Algorithmes (Ordinateur) --- Algoritmen (Computer) --- Approximatietheorie --- Approximation theory --- Automatic theorem proving --- Computer algorithms --- Theorema's--Automatische bewijsvoering --- Théorie des approximations --- Théorèmes--Démonstration automatique --- Computer Science --- Engineering & Applied Sciences --- Theory of approximation --- Automated theorem proving --- Theorem proving, Automated --- Theorem proving, Automatic --- Computer science. --- Computers. --- Algorithms. --- Computer science --- Calculus of variations. --- Combinatorics. --- Computer Science. --- Theory of Computation. --- Algorithm Analysis and Problem Complexity. --- Discrete Mathematics in Computer Science. --- Computation by Abstract Devices. --- Calculus of Variations and Optimal Control; Optimization. --- Mathematics. --- Information theory. --- Computer software. --- Computational complexity. --- Mathematical optimization. --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Complexity, Computational --- Electronic data processing --- Machine theory --- Software, Computer --- Computer systems --- Communication theory --- Communication --- Cybernetics --- Combinatorics --- Algebra --- Informatics --- Science --- Computer science—Mathematics. --- Isoperimetrical problems --- Variations, Calculus of --- Algorism --- Arithmetic --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Calculators --- Cyberspace --- Foundations

Listing 1 - 10 of 13 << page
of 2
>>
Sort by