✦ LIBER ✦

INTEGER PROGRAMMING AND NUMBER THEORY

✍ Scribed by P. L. Buzytsky; G. A. Freiman

Book ID: 118719420
Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 448 KB
Volume: 373
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1981.tb51145.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Theory of linear and integer programming

✍ Alexander Schrijver 📂 Library 📅 1998 🏛 Wiley 🌐 English ⚖ 4 MB

Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It a

Size Ramsey Numbers and Integer Programm

Size Ramsey Numbers and Integer Programming

✍ Oleg Pikhurko 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 190 KB

A Convergent Duality Theory for Integer

A Convergent Duality Theory for Integer Programming

✍ David E. Bell and Jeremy F. Shapiro 📂 Article 📅 1977 🏛 INFORMS 🌐 English ⚖ 442 KB

Integer Programming with a Fixed Number

Integer Programming with a Fixed Number of Variables

✍ H. W. Lenstra, Jr. 📂 Article 📅 1983 🏛 INFORMS 🌐 English ⚖ 433 KB

Integer programming by group theory: com

Integer programming by group theory: computational results

✍ Salkin, HM; Morito, S 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 120 KB

A number theoretic reformulation and dec

A number theoretic reformulation and decomposition method for integer programming

✍ Laurence A. Wolsey 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 759 KB

Integer prcgramsning problems. and especially knapsack and finite abelian group problems, can be exactly replar.ed by equivalent problems of "smaller" size. This reformulation theoretically provides a new m :thod of solution for such problems, but the main advantages lie in reducing coeffitient magn