✦ LIBER ✦

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

✍ Scribed by Padmanaban Kesavan; Russell J. Allgor; Edward P. Gatzke; Paul I. Barton

Publisher: Springer-Verlag
Year: 2004
Tongue: English
Weight: 164 KB
Volume: 100
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-004-0503-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonconvex Generalized Benders Decomposit

Nonconvex Generalized Benders Decomposition for Stochastic Separable Mixed-Integer Nonlinear Programs

✍ Xiang Li; Asgeir Tomasgard; Paul I. Barton 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 971 KB

An approximate algorithm for nonlinear i

An approximate algorithm for nonlinear integer programming

✍ Vassil Vassilev; Krassimira Genova 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 557 KB

A duality theorem and an algorithm for (

A duality theorem and an algorithm for (mixed-) integer nonlinear programming

✍ Egon Balas 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 667 KB

An approximate method for local optima f

An approximate method for local optima for nonlinear mixed integer programming problems

✍ Li Han-Lin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 759 KB

A Lagrangean based branch-and-cut algori

A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures

✍ Ramkumar Karuppiah; Ignacio E. Grossmann 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 332 KB

An approximation algorithm for quadratic

An approximation algorithm for quadratic cost 0–1 mixed integer programming problems

✍ Kumiko Mukai; Keiji Tatsumi; Masao Fukushima 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 586 KB

In this paper, we focus on the quadratic cost 01 mixed integer programming problem. First, we formulate the problem as a two-level programming problem that consists of a lower-level continuous quadratic programming problem with 01 variables fixed and an upper-level nonlinear 01 programming problem.