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
✦ LIBER ✦
Linear 0–1 programming: A comparison of implicit enumeration algorithms
✍ Scribed by Subhash C. Narula; Joseph R. Kindorf
- Publisher
- Elsevier Science
- Year
- 1979
- Tongue
- English
- Weight
- 453 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0305-0548
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An algorithm to perform a complete right
✍
Alejandro Crema
📂
Article
📅
1999
🏛
Elsevier Science
🌐
English
⚖ 143 KB
102 Interactive algorithm of large scale
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 126 KB
Theory of linear and integer programming
📂
Article
📅
1987
🏛
Elsevier Science
🌐
English
⚖ 27 KB
This book represents a wonderful piece of work on the subject. It is absolutely impossible to write a more complete, well-documented and well-written treatise. Very interesting historical comments can also be found. They greatly help to understand the development of
ELSIM—A user-friendly PC program for ele
✍
Lesław K. Bieniasz
📂
Article
📅
1992
🏛
Elsevier Science
🌐
English
⚖ 461 KB
ChemInform Abstract: Comparison of a Neu
✍
Vellarkad N. Viswanadhan; Geoffrey A. Mueller; Subhash C. Basak; John N. Weinste
📂
Article
📅
2010
🏛
John Wiley and Sons
⚖ 27 KB
👁 1 views