✦ LIBER ✦

A simplex method for zero-one mixed integer linear programs

✍ Scribed by R.W Rutledge

Book ID: 107798870
Publisher: Elsevier Science
Year: 1967
Tongue: English
Weight: 513 KB
Volume: 18
Category: Article
ISSN: 0022-247X
DOI: 10.1016/0022-247x(67)90065-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tools for reformulating logical forms in

Tools for reformulating logical forms into zero-one mixed integer programs

✍ G. Mitra; C. Lucas; S. Moody; E. Hadjiconstantinou 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 862 KB

A primal-dual simplex method for linear

A primal-dual simplex method for linear programs

✍ Norman D. Curet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 375 KB

A projective simplex method for linear p

A projective simplex method for linear programming

✍ Ping-Qi Pan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Linear programming problems with quite square coecient matrix form a wide range of problems that are not amenable to existing algorithms. The method proposed in this paper attacks such problems from the dual side, alternatively arranging computations of the simplex method using the QR factorization.

A simplex procedure for linear programs

A simplex procedure for linear programs with some 0–1 integer constraints

✍ A.K. Chakravarty 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A revised simplex method for linear mult

A revised simplex method for linear multiple objective programs

✍ J. P. Evans; R. E. Steuer 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 834 KB

A disjunctive cutting plane procedure fo

A disjunctive cutting plane procedure for general mixed-integer linear programs

✍ Jonathan H. Owen; Sanjay Mehrotra 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 133 KB