A DUAL ALGORITHM FOR SUBMODULAR FLOW PROBLEMS

A dual algorithm for the submodular flow problem is proposed. The concept of the 'best improving set' is used to increase the dual objective as fast as possible, which is the kind of steepest ascent method employed by R. Hassin for the minimum cost now problem. For the dual optimal solution thus obtained, the associated submodular flow is constructed by complementary slackness.
Publisher
ELSEVIER SCIENCE BV
Issue Date
1991-11
Language
ENG
Citation

OPERATIONS RESEARCH LETTERS, v.10, no.8, pp.489 - 495

ISSN
0167-6377
DOI
10.1016/0167-6377(91)90027-M
URI
http://hdl.handle.net/10203/4842
Appears in Collection
KSIM-Journal Papers(저널논문)
  • Hit : 317
  • Download : 95
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 4 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0