A non improving simplex algorithm for transportation problems

Konstantinos Paparrizos

RAIRO - Operations Research - Recherche Opérationnelle (1996)

  • Volume: 30, Issue: 1, page 1-15
  • ISSN: 0399-0559

How to cite

top

Paparrizos, Konstantinos. "A non improving simplex algorithm for transportation problems." RAIRO - Operations Research - Recherche Opérationnelle 30.1 (1996): 1-15. <http://eudml.org/doc/105106>.

@article{Paparrizos1996,
author = {Paparrizos, Konstantinos},
journal = {RAIRO - Operations Research - Recherche Opérationnelle},
keywords = {pivoting; strong bases; forest algorithms; exterior point algorithms; transportation problem; simplex type algorithm},
language = {eng},
number = {1},
pages = {1-15},
publisher = {EDP-Sciences},
title = {A non improving simplex algorithm for transportation problems},
url = {http://eudml.org/doc/105106},
volume = {30},
year = {1996},
}

TY - JOUR
AU - Paparrizos, Konstantinos
TI - A non improving simplex algorithm for transportation problems
JO - RAIRO - Operations Research - Recherche Opérationnelle
PY - 1996
PB - EDP-Sciences
VL - 30
IS - 1
SP - 1
EP - 15
LA - eng
KW - pivoting; strong bases; forest algorithms; exterior point algorithms; transportation problem; simplex type algorithm
UR - http://eudml.org/doc/105106
ER -

References

top
  1. 1. H. ACHATZ, P. KLEINSCHMIDT and K. PAPARRIZOS, A Dual Forest Algorithm for the Assignment Problem, DIMACS, 1989, 4, pp. 1-10. Zbl0743.90077MR1116335
  2. 2. M. AKGÜL, A Genuinly polynomial Primal Simplex Algorithm for the Assignment Problem, SERC Report, IEOR 87-07, 1987, Bilkent University. Zbl0808.90089
  3. 3. K. ANSTRIECHER and T. TERLAKY, A Monotonic Build-Up Simplex Algorithm for Linear Programming, Operations Research, 1994, 42, pp. 556-561. Zbl0810.90089MR1285350
  4. 4. M. L. BALINSKI, Signature Methods for the Assignment Problem, Operations Research, 1985, 33, pp. 527-537. Zbl0583.90064MR791705
  5. 5. M. L. BALINSKI, A Competitive (Dual) Simplex Method for the Assignment Problem, Mathematical Programming, 1986, 34, pp. 125-141. Zbl0596.90064MR838474
  6. 6. W. H. CUNNINGHAM, A Network Simplex Algorithm, Mathematica! Programming, 1976, 11, pp. 105-116. Zbl0352.90039MR462532
  7. 7. M. S. HUNG and W. O. ROM, Solving the Assignment Problem by Relaxation, Operations Research, 1980, 28, pp. 969-982. Zbl0441.90062MR584900
  8. 8. D. GOLDFARB, Efficient Dual Simplex Algorithms for the Assignment Problem, Mathematica! Programming, 1985, 33, pp. 969-982. Zbl0578.90051MR808910
  9. 9. P. KLEINSCHMIDT, C. W. LEE and H. SCANNATH, Transportation Problems Which can be Solved by the Use of Hirsch-paths for the Dual Problems, Mathematical Programming, 1987, 37, pp. 153-168. Zbl0642.90070MR883018
  10. 10. K. PAPARRIZOS, An Infeasible (Exterior Point) Simplex Algorithm for Assignment Problems, Mathematical Programming, 1988, 57, pp. 45-54. Zbl0734.90055MR1119244
  11. 11. K. PAPARRIZOS, A Network Exterior Point Algorithm, Presented at the EURO X Conference on Operational Research, Beograd, Yug, 1989. 
  12. 12. K. PAPARRIZOS, An Exterior Point Simplex Algorithm for General Linear Problems, Annals of Operations Research, 1993, 32, pp. 497-508. Zbl0786.90043MR1260034
  13. 13. T. TERLAKY, A Convergent Criss-Cross Method, Math. Oper. und Stat. ser. Optimization, 1985, 16, pp. 683-690. Zbl0581.90052MR798939
  14. 14. S. ZIONTS, The Criss-Cross Method for Solving Linear Programming Problems, Management Science, 1969, 75, pp. 426-445. Zbl1231.90294

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.