✦ LIBER ✦

On boundedness of (quasi-)convex integer optimization problems

✍ Scribed by Wiesława T. Obuchowska

Publisher: Springer
Year: 2008
Tongue: English
Weight: 284 KB
Volume: 68
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-007-0196-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer Optimization on Convex Semialgeb

Integer Optimization on Convex Semialgebraic Sets

✍ L. Khachiyan; L. Porkolab 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 115 KB

Vector and matrix apportionment problems

Vector and matrix apportionment problems and separable convex integer optimization

✍ N. Gaffke; F. Pukelsheim 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 306 KB

On a problem of integer convex interpola

On a problem of integer convex interpolation

✍ A. L. Smirnov 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 176 KB

Regularization of integer vector optimiz

Regularization of integer vector optimization problems

✍ L. N. Kozeratskaya; T. T. Lebedeva; T. I. Sergienko 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 256 KB

On general vector quasi-optimization pro

On general vector quasi-optimization problems

✍ Angelo Guerraggio; Nguyen Xuan Tan 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 125 KB

Global optimization of mixed-integer non

Global optimization of mixed-integer nonlinear problems

✍ C. S. Adjiman; I. P. Androulakis; C. A. Floudas 📂 Article 📅 2000 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 406 KB 👁 2 views

## Abstract Two novel deterministic global optimization algorithms for nonconvex mixed‐integer problems (MINLPs) are proposed, using the advances of the αBB algorithm for nonconvex NLPs of Adjiman et al. The special structure mixed‐integer αBB algorithm (SMIN‐αBB) addresses problems with nonconvexi