Integer Programming ( Volume 76 )

Publication series :Volume 76

Author: Greenberg   Harold  

Publisher: Elsevier Science‎

Publication year: 1971

E-ISBN: 9780080955858

P-ISBN(Paperback): 9780122994500

P-ISBN(Hardback):  9780122994500

Subject: O221.4 integer programming

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

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;
methods for low-rank matrix approximations; hybrid methods based on a combination of iterative procedures and best operator approximation; and
methods for information compression and filtering under condition that a filter model should satisfy restrictions associated with causality and different types of memory.

As a result, the book represents a blend of new methods in general computational analysis,
and specific, but also generic, techniques for study of systems theory ant its particular
branches, such as optimal filtering and information compression.

- Best operator approximation,
- Non-Lagrange interpolation,
- Generic Karhunen-Loeve transform
- Generalised low-rank matrix approximation
- Optimal data compression
- Optimal nonlinear filtering

Chapter

Front Cover

pp.:  1 – 4

Integer Programming

pp.:  4 – 5

Copyright Page

pp.:  5 – 8

Contents

pp.:  8 – 12

Preface

pp.:  12 – 15

Chapter 1. Introduction to Integer Programming

pp.:  15 – 27

Chapter 2. Linear Programming

pp.:  27 – 61

Chapter 3. All-Integer Methods

pp.:  61 – 95

Chapter 4. Solving Integer Programs by Enumeration

pp.:  95 – 117

Chapter 5. Continuous Solution Methods

pp.:  117 – 149

Chapter 6. Number Theory Results

pp.:  149 – 169

Chapter 7. Dynamic Programming Solutions

pp.:  169 – 191

Chapter 8. Branch and Bound Procedures

pp.:  191 – 207

AUTHOR INDEX

pp.:  207 – 208

SUBJECT INDEX

pp.:  208 – 215

The users who browse this book also browse


No browse record.