EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 30 / No 1 (1996) RAIRO-Oper. Res., 30 1 (1996) 1-15 References
Free Access
Issue
RAIRO-Oper. Res.
Volume 30, Number 1, 1996
Page(s) 1 - 15
DOI https://doi.org/10.1051/ro/1996300100011
Published online 10 February 2017
  • 1. H. ACHATZ, P. KLEINSCHMIDT and K. PAPARRIZOS, A Dual Forest Algorithm for the Assignment Problem, DIMACS, 1989, 4, pp. 1-10. [MR: 1116335] [Zbl: 0743.90077] [Google Scholar]
  • 2. M. AKGÜL, A Genuinly polynomial Primal Simplex Algorithm for the Assignment Problem, SERC Report, IEOR 87-07, 1987, Bilkent University. [Zbl: 0808.90089] [Google Scholar]
  • 3. K. ANSTRIECHER and T. TERLAKY, A Monotonic Build-Up Simplex Algorithm for Linear Programming, Operations Research, 1994, 42, pp. 556-561. [MR: 1285350] [Zbl: 0810.90089] [Google Scholar]
  • 4. M. L. BALINSKI, Signature Methods for the Assignment Problem, Operations Research, 1985, 33, pp. 527-537. [MR: 791705] [Zbl: 0583.90064] [Google Scholar]
  • 5. M. L. BALINSKI, A Competitive (Dual) Simplex Method for the Assignment Problem, Mathematical Programming, 1986, 34, pp. 125-141. [MR: 838474] [Zbl: 0596.90064] [Google Scholar]
  • 6. W. H. CUNNINGHAM, A Network Simplex Algorithm, Mathematica! Programming, 1976, 11, pp. 105-116. [MR: 462532] [Zbl: 0352.90039] [Google Scholar]
  • 7. M. S. HUNG and W. O. ROM, Solving the Assignment Problem by Relaxation, Operations Research, 1980, 28, pp. 969-982. [MR: 584900] [Zbl: 0441.90062] [Google Scholar]
  • 8. D. GOLDFARB, Efficient Dual Simplex Algorithms for the Assignment Problem, Mathematica! Programming, 1985, 33, pp. 969-982. [MR: 808910] [Zbl: 0578.90051] [Google Scholar]
  • 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. [MR: 883018] [Zbl: 0642.90070] [Google Scholar]
  • 10. K. PAPARRIZOS, An Infeasible (Exterior Point) Simplex Algorithm for Assignment Problems, Mathematical Programming, 1988, 57, pp. 45-54. [MR: 1119244] [Zbl: 0734.90055] [Google Scholar]
  • 11. K. PAPARRIZOS, A Network Exterior Point Algorithm, Presented at the EURO X Conference on Operational Research, Beograd, Yug, 1989. [Google Scholar]
  • 12. K. PAPARRIZOS, An Exterior Point Simplex Algorithm for General Linear Problems, Annals of Operations Research, 1993, 32, pp. 497-508. [MR: 1260034] [Zbl: 0786.90043] [Google Scholar]
  • 13. T. TERLAKY, A Convergent Criss-Cross Method, Math. Oper. und Stat. ser. Optimization, 1985, 16, pp. 683-690. [MR: 798939] [Zbl: 0581.90052] [Google Scholar]
  • 14. S. ZIONTS, The Criss-Cross Method for Solving Linear Programming Problems, Management Science, 1969, 75, pp. 426-445. [Zbl: 1231.90294] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.