FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2006228567> ?p ?o ?g. }

• W2006228567 endingPage "104" @default.
• W2006228567 startingPage "76" @default.
• W2006228567 abstract "This paper presents two new scaling algorithms for the minimum cost network flow problem, one a primal cycle canceling algorithm, the other a dual cut canceling algorithm. Both algorithms scale a relaxed optimality parameter, and create a second, inner relaxation. The primal algorithm uses the inner relaxation to cancel a most negative node-disjoint family of cycles w.r.t. the scaled parameter, the dual algorithm uses it to cancel most positive cuts w.r.t. the scaled parameter. We show that in a network with n nodes and m arcs, both algorithms need to cancel only Omn objects per scaling phase.Furthermore, we show how to efficiently implement both algorithms to yield weakly polynomial running times that are as fast as any other cycle or cut canceling algorithms. Our algorithms have potential practical advantages compared to some other canceling algorithms as well.Along the way, we give a comprehensive survey of cycle and cut canceling algorithms for min-cost flow. We also clarify the formal duality between cycles and cuts." @default.
• W2006228567 created "2016-06-24" @default.
• W2006228567 creator A5003295530 @default.
• W2006228567 creator A5040460257 @default.
• W2006228567 creator A5079981879 @default.
• W2006228567 date "2000-02-01" @default.
• W2006228567 modified "2023-09-27" @default.
• W2006228567 title "Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow" @default.
• W2006228567 cites W1483497677 @default.
• W2006228567 cites W151373834 @default.
• W2006228567 cites W1963951527 @default.
• W2006228567 cites W1967030975 @default.
• W2006228567 cites W1969357318 @default.
• W2006228567 cites W1974338972 @default.
• W2006228567 cites W1975387839 @default.
• W2006228567 cites W1992170089 @default.
• W2006228567 cites W1993305973 @default.
• W2006228567 cites W1998128290 @default.
• W2006228567 cites W2007315239 @default.
• W2006228567 cites W2018804864 @default.
• W2006228567 cites W2019053404 @default.
• W2006228567 cites W2022163094 @default.
• W2006228567 cites W2036772106 @default.
• W2006228567 cites W2046043928 @default.
• W2006228567 cites W2046715803 @default.
• W2006228567 cites W2047001449 @default.
• W2006228567 cites W2048790997 @default.
• W2006228567 cites W2048926244 @default.
• W2006228567 cites W2053352956 @default.
• W2006228567 cites W2057718356 @default.
• W2006228567 cites W2060088365 @default.
• W2006228567 cites W2061872629 @default.
• W2006228567 cites W2065932050 @default.
• W2006228567 cites W2066087428 @default.
• W2006228567 cites W2073264848 @default.
• W2006228567 cites W2079045732 @default.
• W2006228567 cites W2084224084 @default.
• W2006228567 cites W2090010485 @default.
• W2006228567 cites W2090219729 @default.
• W2006228567 cites W2090359754 @default.
• W2006228567 cites W2092572272 @default.
• W2006228567 cites W2097004206 @default.
• W2006228567 cites W2099463627 @default.
• W2006228567 cites W2140432141 @default.
• W2006228567 cites W2149342630 @default.
• W2006228567 cites W2150154671 @default.
• W2006228567 cites W2156036190 @default.
• W2006228567 cites W2160365857 @default.
• W2006228567 cites W2164141517 @default.
• W2006228567 cites W2166541787 @default.
• W2006228567 cites W2227557434 @default.
• W2006228567 cites W2404402443 @default.
• W2006228567 cites W3138503030 @default.
• W2006228567 cites W3139172074 @default.
• W2006228567 cites W4230627818 @default.
• W2006228567 cites W4253576536 @default.
• W2006228567 cites W4294576787 @default.
• W2006228567 cites W569270505 @default.
• W2006228567 doi "https://doi.org/10.1287/moor.25.1.76.15208" @default.
• W2006228567 hasPublicationYear "2000" @default.
• W2006228567 type Work @default.
• W2006228567 sameAs 2006228567 @default.
• W2006228567 citedByCount "18" @default.
• W2006228567 countsByYear W20062285672013 @default.
• W2006228567 countsByYear W20062285672014 @default.
• W2006228567 countsByYear W20062285672015 @default.
• W2006228567 countsByYear W20062285672022 @default.
• W2006228567 crossrefType "journal-article" @default.
• W2006228567 hasAuthorship W2006228567A5003295530 @default.
• W2006228567 hasAuthorship W2006228567A5040460257 @default.
• W2006228567 hasAuthorship W2006228567A5079981879 @default.
• W2006228567 hasConcept C11413529 @default.
• W2006228567 hasConcept C114809511 @default.
• W2006228567 hasConcept C126255220 @default.
• W2006228567 hasConcept C2524010 @default.
• W2006228567 hasConcept C33923547 @default.
• W2006228567 hasConcept C38349280 @default.
• W2006228567 hasConcept C99545648 @default.
• W2006228567 hasConceptScore W2006228567C11413529 @default.
• W2006228567 hasConceptScore W2006228567C114809511 @default.
• W2006228567 hasConceptScore W2006228567C126255220 @default.
• W2006228567 hasConceptScore W2006228567C2524010 @default.
• W2006228567 hasConceptScore W2006228567C33923547 @default.
• W2006228567 hasConceptScore W2006228567C38349280 @default.
• W2006228567 hasConceptScore W2006228567C99545648 @default.
• W2006228567 hasIssue "1" @default.
• W2006228567 hasLocation W20062285671 @default.
• W2006228567 hasOpenAccess W2006228567 @default.
• W2006228567 hasPrimaryLocation W20062285671 @default.
• W2006228567 hasRelatedWork W1535814080 @default.
• W2006228567 hasRelatedWork W1589346146 @default.
• W2006228567 hasRelatedWork W1985635003 @default.
• W2006228567 hasRelatedWork W2069541586 @default.
• W2006228567 hasRelatedWork W2113854128 @default.
• W2006228567 hasRelatedWork W2162223489 @default.
• W2006228567 hasRelatedWork W2339811963 @default.
• W2006228567 hasRelatedWork W2811492617 @default.
• W2006228567 hasRelatedWork W2974330806 @default.

• next