✦ LIBER ✦

A primal algorithm for solving a capacitated network flow problem with additional linear constraints

✍ Scribed by S. Chen; R. Saigal

Publisher: John Wiley and Sons
Year: 1977
Tongue: English
Weight: 768 KB
Volume: 7
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230070105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A primal-dual method for linear-quadrati

A primal-dual method for linear-quadratic gaussian control problems with quadratic constraints

✍ H. T. Toivonen 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 496 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

An iterative thresholding algorithm for

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

✍ I. Daubechies; M. Defrise; C. De Mol 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 332 KB

Variations on a cutting plane method for

Variations on a cutting plane method for solving concave minimization problems with linear constraints

✍ A. Victor Cabot 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 534 KB

## Abstract A cutting plane method for solving concave minimization problems with linear constraints has been advanced by Tui. The principle behind this cutting plane has been applied to integer programming by Balas, Young, Glover, and others under the name of convexity cuts. This paper relates th