Login / Signup

Study of a Disaster Relief Troop's Transportation Problem Based on Minimum Cost Maximum Flow.

Zhen-Sheng PengQing-Ge GongYan-Yu DuanYun WangZhi-Qiang Gao
Published in: EIDWT (2017)
Keyphrases
  • minimum cost
  • transportation problem
  • maximum flow
  • spanning tree
  • disaster relief
  • np hard
  • network flow
  • network flow problem
  • approximation algorithms