𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A projective algorithm for linear programming with no regularity condition

✍ Scribed by J.-P Vial

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
145 KB
Volume
12
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w