✦ LIBER ✦

A Linearization technique for solving the quadratic set covering problem

✍ Scribed by Saxena, R. R.; Arora, S. R.

Book ID: 126928745
Publisher: Taylor and Francis Group
Year: 1997
Tongue: English
Weight: 247 KB
Volume: 39
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331939708844269

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration technique for solving multi-

Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming

✍ S. R. Arora; Ravi Shanker; Neelam Malhotra 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 148 KB

A Cutting-Plane Algorithm for the Quadra

A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem

✍ Mokhtar S. Bazaraa and Jamie J. Goode 📂 Article 📅 1975 🏛 INFORMS 🌐 English ⚖ 262 KB

A revised reformulation-linearization te

A revised reformulation-linearization technique for the quadratic assignment problem

✍ Rostami, Borzou; Malucelli, Federico 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 380 KB

A legendre technique for solving time-va

A legendre technique for solving time-varying linear quadratic optimal control problems

✍ Mohsen Razzaghi; Gamal Elnagar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 521 KB

A methodjtir the optimal control of linear time-varying systems with a quadratic cost jitnctional is proposed. The state and control variables are expanded in the shified Legendre series, and an algorithm is provided for approximating the system dynamics, boundary conditions and peyformance index. T

Solving the set cover problem on a super

Solving the set cover problem on a supercomputer

✍ S.J Shyu; R.C.T Lee 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 454 KB

A new neural network for solving linear

A new neural network for solving linear and quadratic programming problems

✍ Youshen Xia 📂 Article 📅 1996 🏛 IEEE 🌐 English ⚖ 410 KB