Minimum-cost flow problem - PDFSEARCH.IO - Document Search Engine

Minimum-cost flow problem
Results: 17

#	Item
1	. CS711008Z Algorithm Design and Analysis . Lecture 8. Algorithm design technique: Linear programming Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2015-12-15 05:30:55 Network flow Mathematics Minimum-cost flow problem Maximum flow problem Logic form Operations research Numerical analysis
2	Algorithms and Data Structures Winter TermExercises for Units 25 & 26 1. Suppose you are given a directed graph G = (V, E), two vertices s and t, a capacity function c : E → R+ , and another function f : E → Add to Reading List Source URL: www-tcs.cs.uni-sb.de Language: English - Date: 2016-03-17 15:32:23 Graph theory Mathematics Network flow Graph connectivity Combinatorial optimization Maximum flow problem Cut Flow network Max-flow min-cut theorem Minimum-cost flow problem
3	Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014 Add to Reading List Source URL: resources.mpi-inf.mpg.de Language: English - Date: 2014-07-03 07:48:38 Graph theory Mathematics Bipartite graphs Parity Matching Vertex cover Incidence coloring Minimum-cost flow problem
4	PDF Document Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2014-06-26 02:33:00 Graph theory Mathematics Discrete mathematics NP-complete problems Matching Graph connectivity Geometric group theory Train track map Minimum-cost flow problem
5	Single Source Multiroute Flows and Cuts on Uniform Capacity Networks∗ Henning Bruhn† ˇ y‡ Jakub Cern´ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2008-03-13 06:46:48 Network flow Graph theory Mathematics Maximum flow problem Flow network Max-flow min-cut theorem Minimum-cost flow problem Matching Minimum cut Approximate max-flow min-cut theorem FordFulkerson algorithm
6	Scheduling in Green Vehicular Infrastructure with Multiple Roadside Units Amir Khezrian, Abdulla Hammad and Terence D. Todd George Karakostas Add to Reading List Source URL: www.cas.mcmaster.ca Language: English - Date: 2013-12-01 18:58:42 Wireless networking Network flow Operations research Vehicular ad hoc network Minimum-cost flow problem Wireless ad hoc network Intelligent transportation system Maximum flow problem Integer programming
7	Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2009-08-13 03:47:05 Operations research Spanning tree Network flow Minimum spanning tree Submodular set function Flow network Wireless sensor network Shortest path problem Graph theory Mathematics Theoretical computer science
8	PDF Document Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:11 Theoretical computer science Maximum flow problem Flow network Minimum-cost flow problem Ford–Fulkerson algorithm Edmonds–Karp algorithm Shortest path problem Matching Max-flow min-cut theorem Graph theory Mathematics Network flow
9	Near-optimal Sensor Placements: Maximizing Information while Minimizing Communication Cost Andreas Krause Carlos Guestrin Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2006-02-25 23:20:28 Operations research Spanning tree Network flow Minimum spanning tree Submodular set function Flow network Wireless sensor network Shortest path problem Graph theory Mathematics Theoretical computer science
10	Distributed Flow Algorithms for Scalable Similarity Visualization Novi Quadrianto∗ , Dale Schuurmans† and Alex J. Smola‡ ∗ SML-NICTA & RSISE-ANU, Canberra, Australia Email: † Univer Add to Reading List Source URL: webdocs.cs.ualberta.ca Language: English - Date: 2010-12-15 01:15:39 Applied mathematics Operations research Combinatorial optimization Maximum flow problem Minimum-cost flow problem Flow network Linear programming Convex optimization Matching Mathematics Network flow Graph theory