✦ LIBER ✦

The use of complementability in the solution of integer programming problems

✍ Scribed by O.G. Alekseev; V.N. Kolesnikov

Publisher: Elsevier Science
Year: 1970
Weight: 694 KB
Volume: 10
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(70)90061-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The solution of an integer quadratic pro

The solution of an integer quadratic programming problem

✍ V.V. Bashurov 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 158 KB

A method for solution of the bicriterion

A method for solution of the bicriterion mixed integer programming problems

✍ Naonori Nishida; Yoshiaki Ohtake 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 328 KB

Solution of an integer problem of quadra

Solution of an integer problem of quadratic programing

✍ V.F. Dem'ianov; L.Iu. Khudiakov 📂 Article 📅 1965 🏛 Elsevier Science 🌐 English ⚖ 247 KB

Solution of a problem of integer-valued

Solution of a problem of integer-valued programming

✍ Yu.E. Malashenko; A.-I.A. Stanevichyus 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 470 KB

The procurement problem: An integer prog

The procurement problem: An integer programming problem well suited to a solution using duality

✍ Eldon A. Gunn; Andrew Kusiak 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB

The use of dynamic programming methodolo

The use of dynamic programming methodology for the solution of a class of nonlinear programming problems

✍ Mary W. Cooper 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 344 KB

## Abstract This paper presents an application of a method for finding the global solution to a problem in integers with a separable objective function of a very general form. This report shows that there is a relationship between an integer problem with a separable nonlinear objective function and