DC Field | Value | Language |
---|---|---|
dc.contributor.author | CHUNG, NK | ko |
dc.contributor.author | Tcha, Dong Wan | ko |
dc.date.accessioned | 2008-06-03T05:08:57Z | - |
dc.date.available | 2008-06-03T05:08:57Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 1991-11 | - |
dc.identifier.citation | OPERATIONS RESEARCH LETTERS, v.10, no.8, pp.489 - 495 | - |
dc.identifier.issn | 0167-6377 | - |
dc.identifier.uri | http://hdl.handle.net/10203/4842 | - |
dc.description.abstract | 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. | - |
dc.language | English | - |
dc.language.iso | en_US | en |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | A DUAL ALGORITHM FOR SUBMODULAR FLOW PROBLEMS | - |
dc.type | Article | - |
dc.identifier.wosid | A1991GZ03300009 | - |
dc.identifier.scopusid | 2-s2.0-0343872309 | - |
dc.type.rims | ART | - |
dc.citation.volume | 10 | - |
dc.citation.issue | 8 | - |
dc.citation.beginningpage | 489 | - |
dc.citation.endingpage | 495 | - |
dc.citation.publicationname | OPERATIONS RESEARCH LETTERS | - |
dc.identifier.doi | 10.1016/0167-6377(91)90027-M | - |
dc.embargo.liftdate | 9999-12-31 | - |
dc.embargo.terms | 9999-12-31 | - |
dc.contributor.localauthor | Tcha, Dong Wan | - |
dc.contributor.nonIdAuthor | CHUNG, NK | - |
dc.type.journalArticle | Article | - |
dc.subject.keywordAuthor | NETWORK | - |
dc.subject.keywordAuthor | FLOW ALGORITHM | - |
dc.subject.keywordAuthor | OPTIMIZATION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.