Matches in SemOpenAlex for { <https://semopenalex.org/work/W1982016387> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W1982016387 endingPage "816" @default.
- W1982016387 startingPage "799" @default.
- W1982016387 abstract "The maximum flow problem is one of the classic combinatorial optimization problems with many applications, such as electrical powers, traffics, communications, computer networks and logistics. The problem is to find a flow of maximum value on a network from a source to a sink. Ordered binary decision diagram (OBDD) is a canonical form to represent and manipulate the Boolean functions efficiently. OBDD-based symbolic algorithms appear to give improved results for large-scale combinatorial optimization problems by searching the nodes and edges implicitly. For the maximum flow problem in networks, we present the symbolic algebraic decision diagram (ADD) formulation and symbolic algorithms. The augmenting-path-based symbolic algorithm is the combination of the Gabow's scaling algorithm with the binary decision diagram (BDD)-based symbolic algorithm for the maximum flow in 0–1 networks. The Karzanov's algorithm is implemented implicitly, resulting in the preflow-based symbolic algorithm (PSA), in which the vertices on each layer of the layered networks are partitioned by the vertex's input preflow and the total capacity of its outgoing edges, and the edges to push or pull the preflow are selected in terms of the priority function. The improved PSA is developed by integrating the heuristic of Träff's algorithm and the assistant layered networks into the PSA. The symbolic algorithms do not require explicit enumeration of the nodes and edges, and therefore can handle large-scale networks." @default.
- W1982016387 created "2016-06-24" @default.
- W1982016387 creator A5036224495 @default.
- W1982016387 creator A5055838753 @default.
- W1982016387 date "2007-03-01" @default.
- W1982016387 modified "2023-10-16" @default.
- W1982016387 title "The symbolic algorithms for maximum flow in networks" @default.
- W1982016387 cites W1967902984 @default.
- W1982016387 cites W2030224590 @default.
- W1982016387 cites W2047650874 @default.
- W1982016387 cites W2049385396 @default.
- W1982016387 cites W2080267935 @default.
- W1982016387 cites W2090359754 @default.
- W1982016387 cites W2103612457 @default.
- W1982016387 cites W2130762611 @default.
- W1982016387 cites W2139559590 @default.
- W1982016387 cites W2167435507 @default.
- W1982016387 cites W3014094413 @default.
- W1982016387 cites W34381828 @default.
- W1982016387 doi "https://doi.org/10.1016/j.cor.2005.05.009" @default.
- W1982016387 hasPublicationYear "2007" @default.
- W1982016387 type Work @default.
- W1982016387 sameAs 1982016387 @default.
- W1982016387 citedByCount "12" @default.
- W1982016387 countsByYear W19820163872013 @default.
- W1982016387 countsByYear W19820163872014 @default.
- W1982016387 countsByYear W19820163872015 @default.
- W1982016387 countsByYear W19820163872018 @default.
- W1982016387 countsByYear W19820163872021 @default.
- W1982016387 crossrefType "journal-article" @default.
- W1982016387 hasAuthorship W1982016387A5036224495 @default.
- W1982016387 hasAuthorship W1982016387A5055838753 @default.
- W1982016387 hasConcept C11413529 @default.
- W1982016387 hasConcept C114809511 @default.
- W1982016387 hasConcept C126255220 @default.
- W1982016387 hasConcept C132525143 @default.
- W1982016387 hasConcept C157469704 @default.
- W1982016387 hasConcept C173801870 @default.
- W1982016387 hasConcept C187455244 @default.
- W1982016387 hasConcept C3309909 @default.
- W1982016387 hasConcept C33923547 @default.
- W1982016387 hasConcept C41008148 @default.
- W1982016387 hasConcept C80444323 @default.
- W1982016387 hasConcept C80899671 @default.
- W1982016387 hasConceptScore W1982016387C11413529 @default.
- W1982016387 hasConceptScore W1982016387C114809511 @default.
- W1982016387 hasConceptScore W1982016387C126255220 @default.
- W1982016387 hasConceptScore W1982016387C132525143 @default.
- W1982016387 hasConceptScore W1982016387C157469704 @default.
- W1982016387 hasConceptScore W1982016387C173801870 @default.
- W1982016387 hasConceptScore W1982016387C187455244 @default.
- W1982016387 hasConceptScore W1982016387C3309909 @default.
- W1982016387 hasConceptScore W1982016387C33923547 @default.
- W1982016387 hasConceptScore W1982016387C41008148 @default.
- W1982016387 hasConceptScore W1982016387C80444323 @default.
- W1982016387 hasConceptScore W1982016387C80899671 @default.
- W1982016387 hasIssue "3" @default.
- W1982016387 hasLocation W19820163871 @default.
- W1982016387 hasOpenAccess W1982016387 @default.
- W1982016387 hasPrimaryLocation W19820163871 @default.
- W1982016387 hasRelatedWork W1982016387 @default.
- W1982016387 hasRelatedWork W1999396918 @default.
- W1982016387 hasRelatedWork W2115698906 @default.
- W1982016387 hasRelatedWork W2149479807 @default.
- W1982016387 hasRelatedWork W2165423088 @default.
- W1982016387 hasRelatedWork W2372526648 @default.
- W1982016387 hasRelatedWork W2376422522 @default.
- W1982016387 hasRelatedWork W3037299385 @default.
- W1982016387 hasRelatedWork W4300590737 @default.
- W1982016387 hasRelatedWork W789508 @default.
- W1982016387 hasVolume "34" @default.
- W1982016387 isParatext "false" @default.
- W1982016387 isRetracted "false" @default.
- W1982016387 magId "1982016387" @default.
- W1982016387 workType "article" @default.