✦ LIBER ✦

Constrained discriminant analysis via 0/1 mixed integer programming

✍ Scribed by Richard J. Gallagher; Eva K. Lee; David A. Patterson

Book ID: 110379874
Publisher: Springer US
Year: 1997
Tongue: English
Weight: 131 KB
Volume: 74
Category: Article
ISSN: 0254-5330
DOI: 10.1023/a:1018943025993

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lifted inequalities for 0-1 mixed intege

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting

✍ J.-P.P. Richard; I.R. de Farias Jr; G.L. Nemhauser 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 321 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.

Lifted inequalities for 0-1 mixed intege

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

✍ J.-P.P. Richard; I.R. de Farias Jr; G.L. Nemhauser 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 283 KB

A branch-and-bound algorithm for 0–1 par

A branch-and-bound algorithm for 0–1 parametric mixed integer programming

✍ Yoshiaki Ohtake; Naonori Nishida 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 332 KB

Lifted flow cover inequalities for mixed

Lifted flow cover inequalities for mixed 0-1 integer programs

✍ Zonghao Gu; George L. Nemhauser; Martin W.P. Savelsbergh 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 238 KB

A cutting-plane approach to mixed 0–1 st

A cutting-plane approach to mixed 0–1 stochastic integer programs

✍ Claus C. Carøe; Jørgen Tind 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 773 KB

We consider a mixed 0-1 integer programming problem with dual block-angular structure arising in two-stage stochastic programming. A relaxation is proposed such that the problem is decomposed into subproblems each corresponding to the outcomes of the random variable. The convex hull of feasible solu