✦ LIBER ✦

A simple recipe for concise mixed 0-1 linearizations

✍ Scribed by Warren P. Adams; Richard J. Forrester

Book ID: 103877650
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 239 KB
Volume: 33
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.05.001

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Conditional Logic Approach for Strengt

A Conditional Logic Approach for Strengthening Mixed 0-1 Linear Programs

✍ R. Lougee-Heimer; W. Adams 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 410 KB

An efficient linearization technique for

An efficient linearization technique for mixed 0–1 polynomial problem

✍ V.R. Ghezavati; M. Saidi-Mehrabad 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 252 KB

This paper addresses a new and efficient linearization technique to solve mixed 0-1 polynomial problems to achieve a global optimal solution. Given a mixed 0-1 polynomial term z = c t x 1 x 2 . . . x n y, where x 1 , x 2 , . . . , x n are binary (0-1) variables and y is a continuous variable. Also,

A mixed 0-1 linear programming formulati

A mixed 0-1 linear programming formulation for the exact solution of the minimum linear arrangement problem

✍ André R. S. Amaral 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 138 KB

Valid inequalities for mixed 0–1 program

Valid inequalities for mixed 0–1 programs

✍ Tony J. Van Roy; Laurence A. Wolsey 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 531 KB

A simple linear transform for the Folin-

A simple linear transform for the Folin-Lowry protein calibration curve to 1.0 mg/ml

✍ W.T. Coakley; C.J. James 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 449 KB

Generating Convex Polynomial Inequalitie

Generating Convex Polynomial Inequalities for Mixed 0–1 Programs

✍ Robert A. Stubbs; Sanjay Mehrotra 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 176 KB