✦ LIBER ✦

Solving nesting problems with non-convex polygons by constraint logic programming

✍ Scribed by M. A. Carravilla; C. Ribeiro; J. F. Oliveira

Book ID: 108572847
Publisher: John Wiley and Sons
Year: 2003
Tongue: English
Weight: 223 KB
Volume: 10
Category: Article
ISSN: 0969-6016
DOI: 10.1111/1475-3995.00434

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Industrial linear optimization problems

Industrial linear optimization problems solved by constraint logic programming

✍ R. Bisdorff; S. Laurent 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1007 KB

An algorithm for solving a convex progra

An algorithm for solving a convex programming problem with linear constraints

✍ B. N. Pshenichnyi; I. F. Ganzhela 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 384 KB

Decomposition in a non-linear programmin

Decomposition in a non-linear programming problem with a non-convex constraint

✍ A.I. Kosolap 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 316 KB

Solving convex programs with infinitely

Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

✍ Soon-Yi Wu; S.-C. Fang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 541 KB

One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut

An Implementation of the QSPLINE Method

An Implementation of the QSPLINE Method for Solving Convex Quadratic Programming Problems With Simple Bound Constraints

✍ Wu Li; J. J. de Nijs 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 268 KB

A Non-Interior Path Following Method for

A Non-Interior Path Following Method for Convex Quadratic Programming Problems with Bound Constraints

✍ Song Xu 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 117 KB