Free Access
Issue
RAIRO-Oper. Res.
Volume 16, Number 3, 1982
Page(s) 263 - 276
DOI https://doi.org/10.1051/ro/1982160302631
Published online 06 February 2017
  • 1. D. ADOLPHSON et T. C. HU, Optimal Linear Ordering, S.I.A.M. J. on Applied Math., vol. 25, 1973, p. 403-423. [MR: 345618] [Zbl: 0274.90061]
  • 2. K. R. BAKER, Introduction to Sequencing and Scheduling, New York, Wiley, 1974.
  • 3. R. BELLMAN, Dynamic Programming, Princeton, Princeton University Press, 1957. [MR: 90477] [Zbl: 1205.90002]
  • 4. R.E. BURKARD et U. DERIGS, Assignment and Matching Problems : Solution Methods with Fortran-Programs, vol. 184, Lecture Notes in Economics and Mathematical Systems, Springer Verlag, Berlin, Heidelberg, New York. [MR: 610241] [Zbl: 0436.90069]
  • 5. M. GAREY et D. S. JOHNSON, Computers and Intractability, A Guide to the Theory of NP-Completeness, San Francisco, Freeman, 1979. [MR: 519066] [Zbl: 0411.68039]
  • 6. M. GAREY, D. S. JOHNSON et L. STOCKMEYER, Some Simplified NP-Complete Graph Problems, Theoretical Computer Science, vol. 1, 1976, p. 237-267. [MR: 411240] [Zbl: 0338.05120]
  • 7. M. HELD et R. M. KARP, Finite-State Processes and Dynamic Programming, S.I.A.M. J. on Applied Math., vol. 15, 1967, p. 693-718. [MR: 220512] [Zbl: 0155.28701]
  • 8. D. M. SIMMONS, One Dimensional Space Allocation : An Ordering Algorithm, Operations Research, vol. 17, 1969, p. 812-826. [MR: 249090] [Zbl: 0182.53304]
  • 9. D. M. SIMMONS, A Further Note on One-Dimensional Space Allocations, Operations Research, vol. 19, 1971, p. 249.

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.