✦ LIBER ✦

Integer and Combinatorial Optimization.by George L. Nemhauser; Laurence A. Wolsey

✍ Scribed by Review by: Charles Blair

Book ID: 124943915
Publisher: Society for Industrial and Applied Mathematics
Year: 1990
Tongue: English
Weight: 84 KB
Volume: 32
Category: Article
ISSN: 0036-1445
DOI: 10.2307/2030538

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer and Combinatorial Optimizationby

Integer and Combinatorial Optimizationby George L. Nemhauser; Laurence A. Wolsey

✍ Review by: H. P. Williams 📂 Article 📅 1990 🏛 Palgrave Publishers Ltd. 🌐 English ⚖ 108 KB

Integer and Combinatorial Optimization (

Integer and Combinatorial Optimization (Nemhauser/Integer and Combinatorial Optimization) || Integer Lattices

✍ Nemhauser, George; Wolsey, Laurence 📂 Article 📅 2014 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 899 KB

Integer and combinatorial optimization:

Integer and combinatorial optimization: By George Nemhauser and Laurence Wolsey. John Wiley & Sons, Inc., New York. (1999). 763 pages. £48.50

📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 88 KB

Preface. 1. Introduction. 2 . Performance issues in interactive VOD service. 3. Related work. 4. A dynamic approach to VOD scheduling. 5. On improving the transient performance of CSCAN schedulers. 6. Prioritized admission strategies to improve user-perceived performance. 7. Run-time optimization o

Integer and Combinatorial Optimization (

Integer and Combinatorial Optimization (Nemhauser/Integer and Combinatorial Optimization) || Front Matter

✍ Nemhauser, George; Wolsey, Laurence 📂 Article 📅 2014 🏛 John Wiley & Sons, Inc. 🌐 English ⚖ 590 KB

Integer and combinatorial optimization,

Integer and combinatorial optimization, George L. Nemhauser and Laurence A. Wolsey, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York, 1988, ISBN 0-471-82819-X, 763pp, £71.90

✍ Andrzej J. Osiadacz 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB

A recursive procedure to generate all cu

A recursive procedure to generate all cuts for 0–1 mixed integer programs

✍ George L. Nemhauser; Laurence A. Wolsey 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 451 KB