✦ LIBER ✦

Approximating the stability region for binary mixed-integer programs

✍ Scribed by Fatma Kılınç-Karzan; Alejandro Toriello; Shabbir Ahmed; George Nemhauser; Martin Savelsbergh

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 891 KB
Volume: 37
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2009.04.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Outer approximation algorithms for separ

Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programs

✍ Padmanaban Kesavan; Russell J. Allgor; Edward P. Gatzke; Paul I. Barton 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 164 KB

A trust region SQP algorithm for mixed-i

A trust region SQP algorithm for mixed-integer nonlinear programming

✍ Oliver Exler; Klaus Schittkowski 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 164 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

Parameterisation algorithms for the inte

Parameterisation algorithms for the integer linear programs in binary variables

✍ E. Loukakis; A.P. Muhlemann 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 614 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.

The mixed cutting plane algorithm for al

The mixed cutting plane algorithm for all-integer programming

✍ Larry M. Austin; Bharat C. Ruparel 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 677 KB