Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Minimum-cost_flow_problem> ?p ?o. }
Showing items 1 to 17 of
17
with 100 items per page.
- Minimum-cost_flow_problem abstract "The minimum-cost flow problem is to find the cheapest possible way of sending a certain amount of flow through a flow network. Solving this problem is useful for real-life situations involving networks with costs associated (e.g. telecommunications networks), as well as in other situations where the analogy is not so obvious, such as where to locate warehouses.".
- Minimum-cost_flow_problem wikiPageExternalLink lemon.cs.elte.hu.
- Minimum-cost_flow_problem wikiPageID "6807932".
- Minimum-cost_flow_problem wikiPageRevisionID "603811889".
- Minimum-cost_flow_problem hasPhotoCollection Minimum-cost_flow_problem.
- Minimum-cost_flow_problem subject Category:Network_flow.
- Minimum-cost_flow_problem comment "The minimum-cost flow problem is to find the cheapest possible way of sending a certain amount of flow through a flow network. Solving this problem is useful for real-life situations involving networks with costs associated (e.g. telecommunications networks), as well as in other situations where the analogy is not so obvious, such as where to locate warehouses.".
- Minimum-cost_flow_problem label "Minimum-Cost Flow Problem".
- Minimum-cost_flow_problem label "Minimum-cost flow problem".
- Minimum-cost_flow_problem label "Поток минимальной стоимости".
- Minimum-cost_flow_problem label "最小费用最大流问题".
- Minimum-cost_flow_problem sameAs Minimum-Cost_Flow_Problem.
- Minimum-cost_flow_problem sameAs m.0gpy75.
- Minimum-cost_flow_problem sameAs Q2897180.
- Minimum-cost_flow_problem sameAs Q2897180.
- Minimum-cost_flow_problem wasDerivedFrom Minimum-cost_flow_problem?oldid=603811889.
- Minimum-cost_flow_problem isPrimaryTopicOf Minimum-cost_flow_problem.