✦ LIBER ✦

Solution of an integer problem of quadratic programing

✍ Scribed by V.F. Dem'ianov; L.Iu. Khudiakov

Publisher: Elsevier Science
Year: 1965
Tongue: English
Weight: 247 KB
Volume: 29
Category: Article
ISSN: 0021-8928
DOI: 10.1016/0021-8928(65)90161-9

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

Ranking in quadratic integer programming

Ranking in quadratic integer programming problems

✍ Renu Gupta; Lakshmisree Bandopadhyaya; M.C. Puri 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 395 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

An approximation algorithm for quadratic

An approximation algorithm for quadratic cost 0–1 mixed integer programming problems

✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.

A cut approach to a class of quadratic i

A cut approach to a class of quadratic integer programming problems

✍ Jean-Claude Picard; H. Donald Ratliff 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 297 KB

Solving quadratic assignment problems wi

Solving quadratic assignment problems with rectangular distances and integer programming

✍ Robert F. Love; Jsun Y. Wong 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 304 KB

## Abstract The problem considered involves the assignment of __n__ facilities to __n__ specified locations. Each facility has a given nonnegative flow from each of the other facilities. The objective is to minimize the sum of transportation costs. Assume these __n__ locations are given as points