✦ LIBER ✦

An advanced start algorithm for all-integer programming

✍ Scribed by Michael E. Hanna; Larry M. Austin

Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 651 KB
Volume: 12
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(85)90029-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An advanced dual algorithm with constrai

An advanced dual algorithm with constraint relaxation for all-integer programming

✍ Larry M. Austin; Parviz Ghandforoush 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB

A bounded dual (all-integer) integer pro

A bounded dual (all-integer) integer programming algorithm with an objective cut

✍ Larry M. Austin; Michael E. Hanna 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 547 KB

A Surrogate cutting plane algorithm for

A Surrogate cutting plane algorithm for all-integer programming

✍ Larry M. Austin; Parviz Ghandforoush 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 717 KB

The mixed cutting plane algorithm for al

The mixed cutting plane algorithm for all-integer programming

✍ Larry M. Austin; Bharat C. Ruparel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 677 KB

An approximate algorithm for nonlinear i

An approximate algorithm for nonlinear integer programming

✍ Vassil Vassilev; Krassimira Genova 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 557 KB

An algorithm for indefinite integer quad

An algorithm for indefinite integer quadratic programming

✍ S.S. Erenguc; H.P. Benson 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Atmtract--We present an algorithm for finding the global minimum of an indefinite quadratic function over the integers contained in a compact, convex set. To find this minJmmn, the algorithm first transforms the problem into an equivalent problem with a separable objective function. It then uses a b