@article{RO_1996__30_1_1_0, author = {Paparrizos, Konstantinos}, title = {A non improving simplex algorithm for transportation problems}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {1--15}, publisher = {EDP-Sciences}, volume = {30}, number = {1}, year = {1996}, mrnumber = {1399981}, zbl = {0857.90087}, language = {en}, url = {http://archive.numdam.org/item/RO_1996__30_1_1_0/} }
TY - JOUR AU - Paparrizos, Konstantinos TI - A non improving simplex algorithm for transportation problems JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 1996 SP - 1 EP - 15 VL - 30 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/item/RO_1996__30_1_1_0/ LA - en ID - RO_1996__30_1_1_0 ER -
Paparrizos, Konstantinos. A non improving simplex algorithm for transportation problems. RAIRO - Operations Research - Recherche Opérationnelle, Tome 30 (1996) no. 1, pp. 1-15. http://archive.numdam.org/item/RO_1996__30_1_1_0/
1. A Dual Forest Algorithm for the Assignment Problem, DIMACS, 1989, 4, pp. 1-10. | MR | Zbl
, and ,2. A Genuinly polynomial Primal Simplex Algorithm for the Assignment Problem, SERC Report, IEOR 87-07, 1987, Bilkent University. | Zbl
,3. A Monotonic Build-Up Simplex Algorithm for Linear Programming, Operations Research, 1994, 42, pp. 556-561. | MR | Zbl
and ,4. Signature Methods for the Assignment Problem, Operations Research, 1985, 33, pp. 527-537. | MR | Zbl
,5. A Competitive (Dual) Simplex Method for the Assignment Problem, Mathematical Programming, 1986, 34, pp. 125-141. | MR | Zbl
,6. A Network Simplex Algorithm, Mathematica! Programming, 1976, 11, pp. 105-116. | MR | Zbl
,7. Solving the Assignment Problem by Relaxation, Operations Research, 1980, 28, pp. 969-982. | MR | Zbl
and ,8. Efficient Dual Simplex Algorithms for the Assignment Problem, Mathematica! Programming, 1985, 33, pp. 969-982. | MR | Zbl
,9. Transportation Problems Which can be Solved by the Use of Hirsch-paths for the Dual Problems, Mathematical Programming, 1987, 37, pp. 153-168. | MR | Zbl
, and ,10. An Infeasible (Exterior Point) Simplex Algorithm for Assignment Problems, Mathematical Programming, 1988, 57, pp. 45-54. | MR | Zbl
,11. A Network Exterior Point Algorithm, Presented at the EURO X Conference on Operational Research, Beograd, Yug, 1989.
,12. An Exterior Point Simplex Algorithm for General Linear Problems, Annals of Operations Research, 1993, 32, pp. 497-508. | MR | Zbl
,13. A Convergent Criss-Cross Method, Math. Oper. und Stat. ser. Optimization, 1985, 16, pp. 683-690. | MR | Zbl
,14. The Criss-Cross Method for Solving Linear Programming Problems, Management Science, 1969, 75, pp. 426-445.
,