Discrete right hand side parametrization for linear integer programs
✍ Scribed by Søren Holm; Dieter Klein
- Publisher
- Elsevier Science
- Year
- 1978
- Tongue
- English
- Weight
- 338 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0377-2217
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
We designed and implemented an algorithm to solve the continuous right-hand side parametric 0±1-Integer Linear Programming (ILP) problem, that is to solve a family of 0±1-ILP problems in which the problems are related by having identical objective and matrix coecients. Our algorithm works by choosin
By transforming nonsymmetric linear systems to the extended skew-symmetric ones, we present the skew-symmetric methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on the block and global Arnoldi algorithm which is formed by implementing orthogonal