✦ LIBER ✦

Convex integer optimization by constantly many linear counterparts

✍ Scribed by Melamed, Michal; Onn, Shmuel

Book ID: 122112386
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 419 KB
Volume: 447
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.01.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer convex minimization by mixed int

Integer convex minimization by mixed integer linear optimization

✍ Oertel, Timm; Wagner, Christian; Weismantel, Robert 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 381 KB

Solving Pseudo-Convex Mixed Integer Opti

Solving Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques

✍ Tapio Westerlund; Ray Pörn 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 571 KB

Optimal Placement of PMUs by Integer Lin

Optimal Placement of PMUs by Integer Linear Programming

✍ Gou, B. 📂 Article 📅 2008 🏛 IEEE 🌐 English ⚖ 97 KB

Optimal approximation of convex curves b

Optimal approximation of convex curves by functions which are piecewise linear

✍ Momčilo M Gavrilović 📂 Article 📅 1975 🏛 Elsevier Science 🌐 English ⚖ 913 KB

Optimal VAr planning by approximation me

Optimal VAr planning by approximation method for recursive mixed-integer linear programming

✍ Aoki, K.; Fan, M.; Nishikori, A. 📂 Article 📅 1988 🏛 IEEE 🌐 English ⚖ 502 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