✦ LIBER ✦

Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem

✍ Scribed by Vicky Mak; Tommy Thomadsen

Publisher: Springer US
Year: 2006
Tongue: English
Weight: 326 KB
Volume: 11
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-006-8462-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polyhedral study of the cardinality co

A polyhedral study of the cardinality constrained knapsack problem

✍ I.R. de Farias Jr; G.L. Nemhauser 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 264 KB

A study of exponential neighborhoods for

A study of exponential neighborhoods for the Travelling Salesman Problem and for the Quadratic Assignment Problem

✍ Vladimir G. De&ıbreve;neko; Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 240 KB

Concise RLT forms of binary programs: A

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

✍ Richard J. Forrester; Warren P. Adams; Paul T. Hadavas 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restriction

The FETI family of domain decomposition

The FETI family of domain decomposition methods for inequality-constrained quadratic programming: Application to contact problems with conforming and nonconforming interfaces

✍ Philip Avery; Charbel Farhat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Two domain decomposition methods with Lagrange multipliers for solving iteratively quadratic programming problems with inequality constraints are presented. These methods are based on the FETI and FETI-DP substructuring algorithms. In the case of linear constraints, they do not perform any Newton-li