Network flow problem - PDFSEARCH.IO - Document Search Engine

Network flow problem
Results: 219

#	Item
1	Resistive Network Optimal Power Flow: Uniqueness and Algorithms Chee Wei Tan, Senior Member, IEEE, Desmond W. H. Cai, Student Member, IEEE and Xin Lou Abstract—The optimal power flow (OPF) problem minimizes the power l Add to Reading List Source URL: www.cs.cityu.edu.hk Language: English - Date: 2014-06-04 23:33:17
2	Introduction Network similarity problem Results Acknowledgements Spectra of the Spike Flow Graphs of Recurrent Add to Reading List Source URL: filip.piekniewski.info Language: English - Date: 2013-12-08 19:00:00
3	TECHNISCHE UNIVERSITÄT WIEN Institut für Computergraphik und Algorithmen Load-Dependent and Precedence-Based Models for Pickup and Delivery Problems Add to Reading List Source URL: www.ads.tuwien.ac.at Language: English - Date: 2015-02-11 08:09:39 Graph theory Operations research Mathematics Computational complexity theory Network flow NP-complete problems NP-hard problems Travelling salesman problem Multi-commodity flow problem Flow network
4	CS261: A Second Course in Algorithms Lecture #2: Augmenting Path Algorithms for Maximum Flow∗ Tim Roughgarden† January 7, 2016 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2016-01-22 08:04:42 Graph theory Network flow Mathematics EdmondsKarp algorithm Flow network Maximum flow problem FordFulkerson algorithm Cut Graph traversal Minimum cut Shortest path problem Max-flow min-cut theorem
5	Approximation bounds for Black Hole Search problems? Ralf Klasing?? , Euripides Markou? ? ? , Tomasz Radzik† , Fabiano Sarracco‡ Abstract. A black hole is a highly harmful stationary process residing in a node of a n Add to Reading List Source URL: emarkou.users.uth.gr Language: English - Date: 2016-05-24 11:28:44 Graph theory Mathematics Computational complexity theory Operations research Combinatorial optimization Routing algorithms Search algorithms Edsger W. Dijkstra Travelling salesman problem A* search algorithm Flow network Tree traversal
6	LNCSEfficient Dynamic Aggregation Add to Reading List Source URL: webee.technion.ac.il Language: English - Date: 2007-05-14 09:17:03 Graph theory Mathematics Computational complexity theory Edsger W. Dijkstra Network theory Shortest path problem Minimum spanning tree Network flow Dynamic programming
7	usinggraphcuts_in_gpus_for_color_based_human_skin_segmentation_revision Add to Reading List Source URL: www.gcg.ufjf.br Language: English - Date: 2016-07-25 19:25:40 Graph theory Mathematics Network flow Computer vision Image segmentation Search algorithms Edsger W. Dijkstra Graph cuts in computer vision Maximum flow problem Watershed Flow network Pushrelabel maximum flow algorithm
8	. 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
9	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
10	Time-Dependent Hazardous-materials Network Design Problem Tolou Esfandeh∗a , Rajan Batta†b , and Changhyun Kwon‡c a Optym, Gainesville, FL, USA Department of Industrial and Systems Engineering, University at Buffal Add to Reading List Source URL: www.chkwon.net Language: English - Date: 2016-08-04 11:55:32 Neuropsychology Neuroscience Actuarial science Financial risk Probability Risk Traffic flow Decision-making Dangerous goods Applied mathematics