✦ LIBER ✦

A greedy algorithm for solving a class of convex programming problems and its connection with polymatroid theory

✍ Scribed by G. Morton; R. von Randow; K. Ringwald

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for solving

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

A branch and bound algorithm for globall

✍ Hongwei Jiao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 574 KB

An algorithm for solving a class of prob

✍ A. V. Krushevskii; R. A. Polyak; M. E. Primak 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 442 KB

A projection and contraction method for

✍ Bingsheng He 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 607 KB

Decomposition methods for solving a clas

✍ Le Dung Muu; Thai Quynh Phong; Pham Dinh Tao 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 704 KB

Computational experience with a backtrac

✍ James H. Patterson; F. Brian Talbot; Roman Slowinski; Jan Wegłarz 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 895 KB