Matches in SemOpenAlex for { <https://semopenalex.org/work/W1994440468> ?p ?o ?g. }
Showing items 1 to 59 of
59
with 100 items per page.
- W1994440468 abstract "The minimum cost flow problem exists in many areas of industry. The problem is defined as: given a network composed of nodes and directed arcs with the arcs having an upper capacity, lower capacity, and a cost per unit of commodity transferred, find the maximum flow at minimum cost between two specified nodes while satisfying all relevant capacity constraints. The classical maximum flow problem is a special case of the general minimum cost flow problem in which all arc costs are identical and the lower capacities of all arcs are zero. The objective in this problem is also to find the maximum flow between two specific nodes. Algorithms exist for the solution of these problems and are coded for running on sequential computers. However, many parts of both of these problems exhibit characteristics that indicate it would be worthwhile to consider their solution by associative processors." @default.
- W1994440468 created "2016-06-24" @default.
- W1994440468 creator A5010191000 @default.
- W1994440468 creator A5066557654 @default.
- W1994440468 date "1972-01-01" @default.
- W1994440468 modified "2023-09-25" @default.
- W1994440468 title "The solution of the minimum cost flow and maximum flow network problems using associative processing" @default.
- W1994440468 cites W1965899076 @default.
- W1994440468 cites W2045019323 @default.
- W1994440468 cites W2057718356 @default.
- W1994440468 cites W2071871891 @default.
- W1994440468 cites W2111182457 @default.
- W1994440468 doi "https://doi.org/10.1145/1480083.1480110" @default.
- W1994440468 hasPublicationYear "1972" @default.
- W1994440468 type Work @default.
- W1994440468 sameAs 1994440468 @default.
- W1994440468 citedByCount "3" @default.
- W1994440468 crossrefType "proceedings-article" @default.
- W1994440468 hasAuthorship W1994440468A5010191000 @default.
- W1994440468 hasAuthorship W1994440468A5066557654 @default.
- W1994440468 hasConcept C114809511 @default.
- W1994440468 hasConcept C126255220 @default.
- W1994440468 hasConcept C157469704 @default.
- W1994440468 hasConcept C159423971 @default.
- W1994440468 hasConcept C170334043 @default.
- W1994440468 hasConcept C202444582 @default.
- W1994440468 hasConcept C2524010 @default.
- W1994440468 hasConcept C33923547 @default.
- W1994440468 hasConcept C38349280 @default.
- W1994440468 hasConcept C41008148 @default.
- W1994440468 hasConcept C99545648 @default.
- W1994440468 hasConceptScore W1994440468C114809511 @default.
- W1994440468 hasConceptScore W1994440468C126255220 @default.
- W1994440468 hasConceptScore W1994440468C157469704 @default.
- W1994440468 hasConceptScore W1994440468C159423971 @default.
- W1994440468 hasConceptScore W1994440468C170334043 @default.
- W1994440468 hasConceptScore W1994440468C202444582 @default.
- W1994440468 hasConceptScore W1994440468C2524010 @default.
- W1994440468 hasConceptScore W1994440468C33923547 @default.
- W1994440468 hasConceptScore W1994440468C38349280 @default.
- W1994440468 hasConceptScore W1994440468C41008148 @default.
- W1994440468 hasConceptScore W1994440468C99545648 @default.
- W1994440468 hasLocation W19944404681 @default.
- W1994440468 hasOpenAccess W1994440468 @default.
- W1994440468 hasPrimaryLocation W19944404681 @default.
- W1994440468 hasRelatedWork W184565551 @default.
- W1994440468 hasRelatedWork W2051329268 @default.
- W1994440468 hasRelatedWork W2069541586 @default.
- W1994440468 hasRelatedWork W2339811963 @default.
- W1994440468 hasRelatedWork W2590727506 @default.
- W1994440468 hasRelatedWork W2974330806 @default.
- W1994440468 hasRelatedWork W3000598246 @default.
- W1994440468 hasRelatedWork W3141113327 @default.
- W1994440468 hasRelatedWork W3159013657 @default.
- W1994440468 hasRelatedWork W4206915070 @default.
- W1994440468 isParatext "false" @default.
- W1994440468 isRetracted "false" @default.
- W1994440468 magId "1994440468" @default.
- W1994440468 workType "article" @default.