Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

A survey on exact algorithms for the maximum flow and minimum-cost flow problems

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
اقرأ أكثر حفظ في قائمتي
  • معلومة اضافية
    • الموضوع:
      2023
    • Collection:
      Lancaster University: Lancaster Eprints
    • نبذة مختصرة :
      Network flow problems form an important and much‐studied family of combinatorial optimization problems, with a huge array of practical applications. Two network flow problems in particular have received a great deal of attention: the maximum flow and minimum‐cost flow problems. We review the progress that has been made on exact solution algorithms for these two problems, with an emphasis on worst‐case running times.
    • File Description:
      text
    • Relation:
      https://eprints.lancs.ac.uk/id/eprint/194935/1/netflow_survey.pdf; Cruz Mejía, Oliverio and Letchford, Adam (2023) A survey on exact algorithms for the maximum flow and minimum-cost flow problems. Networks, 82 (2). pp. 167-176. ISSN 0028-3045
    • الدخول الالكتروني :
      https://eprints.lancs.ac.uk/id/eprint/194935/
      https://eprints.lancs.ac.uk/id/eprint/194935/1/netflow_survey.pdf
    • Rights:
      creative_commons_attribution_4_0_international_license
    • الرقم المعرف:
      edsbas.B943371F