✦ LIBER ✦

Decomposition Branch-and-Bound Based Algorithm for Linear Programs with Additional Multiplicative Constraints

✍ Scribed by H. P. Benson

Publisher: Springer
Year: 2005
Tongue: English
Weight: 160 KB
Volume: 126
Category: Article
ISSN: 0022-3239
DOI: 10.1007/s10957-005-2655-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simplicial Branch-and-Reduce Algorithm f

Simplicial Branch-and-Reduce Algorithm for Convex Programs with a Multiplicative Constraint

✍ H. P. Benson 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 525 KB

A branch and bound algorithm with constr

A branch and bound algorithm with constraint partitioning for integer goal programming problems

✍ Jeffrey L. Arthur; A. Ravindran 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Zero-one integer programs with few const

Zero-one integer programs with few constraints —Efficient branch and bound algorithms

✍ Bezalel Gavish; Hasan Pirkul 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 723 KB

A branch-and-cut algorithm for nonconvex

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

✍ Dieter Vandenbussche; George L. Nemhauser 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

An implicit branch-and-bound algorithm f

An implicit branch-and-bound algorithm for mixed-integer-linear programming

✍ Youling Lin; Larry M. Austin; James R. Burns 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 596 KB

A Parallel Algorithm for Linear Programs

A Parallel Algorithm for Linear Programs with an Additional Reverse Convex Constraint

✍ Shih-Mim Liu; G.P. Papavassilopoulos 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 211 KB

A parallel method for globally minimizing a linear program with an additional reverse convex constraint is proposed which combines the outer approximation technique and the cutting plane method. Basically p (≤n) processors are used for a problem with n variables and a globally optimal solution is fo