Benutzerdefiniertes Cover
Integer programming / edited by Harold Greenberg
Mitwirkende(r): Resource type: Ressourcentyp: Buch (Online)Buch (Online)Sprache: Englisch Reihen: Mathematics in science and engineering ; v. 76Verlag: New York : Academic Press, 2010Beschreibung: Online Ressource (xii, 196 pages)ISBN:- 9780122994500
- 9780080955858
- 0080955851
- 0122994507
- 9780122994500
- 519.77
- 519.7/7
- T57.7 QA3
- QA3
- T57.7
Inhalte:
Zusammenfassung: In this book, we study theoretical and practical aspects of computing methods for mathematical modelling of nonlinear systems. A number of computing techniques are considered, such as methods of operator approximation with any given accuracy; operator interpolation techniques including a non-Lagrange interpolation; methods of system representation subject to constraints associated with concepts of causality, memory and stationarity; methods of system representation with an accuracy that is the best within a given class of models; methods of covariance matrix estimation;<BR id="CRLF">methods for low-rank matrix approximations; hybrid methods based on a combination of iterative procedures and best operator approximation; and<BR id="CRLF">methods for information compression and filtering under condition that a filter model should satisfy restrictions associated with causality and different types of memory.<BR id="CRLF"><BR id="CRLF">As a result, the book represents a blend of new methods in general computational analysis, <BR id="CRLF">and specific, but also generic, techniques for study of systems theory ant its particular<BR id="CRLF">branches, such as optimal filtering and information compressionPPN: PPN: 878888462Package identifier: Produktsigel: BSZ-33-EBS-C1UB | BSZ-33-EBS-HSAA | GBV-33-EBS-MRI | GBV-33-EBS-ZHB | GBV-33-Freedom-BL | ZDB-1-ELC | ZDB-33-EBS | ZDB-33-ESD
Front Cover; Integer Programming; Copyright Page; Contents; Preface; Chapter 1. Introduction to Integer Programming; 1 Presentation of the Problem; 2 Pilot Scheduling; 3 A Quadratic Assignment Problem; 4 The Knapsack Problem; 5 The Traveling Salesman Problem; 6 The Fixed-Charge Problem; 7 Nonlinear Approximation; 8 Dichotomies; Chapter 2. Linear Programming; 1 The General Linear Program; 2 Recognition of Optimality; 3 The Simplex Method; 4 Tableau Form; 5 The Inverse Matrix Method; 6 Variables with Upper Bounds; 7 The Lexicographic Dual Simplex Method; Chapter 3. All-Integer Methods
1 Optimality Theory for Integer Programming2 Improving a Nonoptimal Solution; 3 Equivalent Integer Programs; 4 Convergence to Optimality; 5 Bounded Variable Problems; 6 Negative cj Values; 7 The Use of Bounding Forms; 8 A Primal Integer Method; Chapter 4. Solving Integer Programs by Enumeration; 1 A Direct Enumeration Method; 2 Solution to the Integer Program; 3 An Accelerated Enumeration; 4 A Dynamic Programming Method; 5 Knapsack Functions; Chapter 5. Continuous Solution Methods; 1 A Continuous Solution Method; 2 Improving a Nonoptimal Solution; 3 Convergence in the Algorithm
4 Reducing the Continuous Solution to an All- Integer Format5 Bounding the Determinant Value; 6 Bounded Variable Problems; 7 The Mixed Integer Problem; Chapter 6. Number Theory Results; 1 The Euclidean Algorithm; 2 Linear Diophantine Equations; 3 Linear Congruences; 4 The Solution of a System of Linear Congruences; Chapter 7. Dynamic Programming Solutions; 1 A Dynamic Programming Solution; 2 Reducing the Number of Congruences; 3 An Accelerated Dynamic Programming Solution; Chapter 8. Branch and Bound Procedures; 1 A Branch and Bound Method; 2 Tightening the Bounds; 3 The Mixed Integer Problem
AUTHOR INDEXSUBJECT INDEX;
Dieser Titel hat keine Exemplare
Restrictions unspecified star
Online-Ausg. [S.l.] : HathiTrust Digital Library
Online-Ausg. [S.l.] : HathiTrust Digital Library. Online-Ausg. [S.l.] : HathiTrust Digital Library
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
English