✦ LIBER ✦

Polynomial time algorithms for some classes of constrained nonconvex quadratic problems

✍ Scribed by Pardalos, P.M.

Book ID: 117991526
Publisher: Taylor and Francis Group
Year: 1990
Tongue: English
Weight: 592 KB
Volume: 21
Category: Article
ISSN: 0233-1934
DOI: 10.1080/02331939008843615

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Global optimization of a class of noncon

Global optimization of a class of nonconvex quadratically constrained quadratic programming problems

✍ Yong Xia 📂 Article 📅 2011 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 194 KB

A polynomial-time recursive algorithm fo

A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems

✍ Walid Ben-Ameur; José Neto 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Quadratic-time algorithm for a string co

Quadratic-time algorithm for a string constrained LCS problem

✍ Sebastian Deorowicz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Polynomial time approximation schemes fo

Polynomial time approximation schemes for class-constrained packing problems

✍ Hadas Shachnai; Tami Tamir 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 207 KB

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can

Linear time algorithms for some separabl

Linear time algorithms for some separable quadratic programming problems

✍ Nimrod Megiddo; Arie Tamir 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A Branch and Bound Method via d.c. Optim

A Branch and Bound Method via d.c. Optimization Algorithms and Ellipsoidal Technique for Box Constrained Nonconvex Quadratic Problems

✍ Le Thi Hoai An; Pham Dinh Tao 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 189 KB