Tag network_flow [15 articles] Export Sort

Recent papers classified by the tag network_flow.

Hide details

	The fleet assignment problem: Solving a large-scale integer program [My Copy] Mathematical Programming, Vol. 70, No. 1. (1 October 1995), pp. 211-232. by Christopher A. Hane, Cynthia Barnhart, Ellis L. Johnson, Roy E. Marsten, George L. Nemhauser, Gabriele Sigismondi posted to network_flow multicommodity_flow_problem linear_programming_techniques interior_point_algorithm assignment_problem by rchen on 2009-10-27 21:44:09 as
	Routing and wavelength assignment in optical networks [My Copy] IEEE/ACM Trans. Netw., Vol. 11, No. 2. (2003), pp. 259-272. by Asuman E. Ozdaglar, Dimitri P. Bertsekas posted to network_optimization network_flow by rchen on 2009-10-27 21:40:28 as
	Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms [My Copy] Journal of the ACM, Vol. 46, No. 6. (November 1999), pp. 787-832. by Tom Leighton, Satish Rao posted to approximation cut network_flow by mohits on 2008-05-01 22:49:36 as along with 3 people michael_hliao tmmurali NeilInCanadia
	A variational inequality formulation of the Dynamic Traffic Assignment Problem [My Copy] European Journal of Operational Research, Vol. 71, No. 2. (10 December 1993), pp. 188-204. by Omar Drissi-Kaitouni posted to network_flow traffic by NeilInCanadia on 2008-02-19 21:16:15 as
	Optimal Time-Varying Flows on Congested Networks [My Copy] Operations Research, Vol. 35, No. 1. (1987), pp. 58-69. by Malachy Carey posted to network_flow traffic by NeilInCanadia on 2008-02-18 23:00:26 as
	Time-Expanded Graphs for Flow-Dependent Transit Times [My Copy] Algorithms — ESA 2002 (2002), pp. 49-56. by Ekkehard Köhler, Katharina Langkau, Martin Skutella posted to network_flow traffic by NeilInCanadia on 2008-02-18 17:21:52 as
	A survey of dynamic network flows [My Copy] Annals of Operations Research, Vol. 20, No. 1. (10 December 1989), pp. 1-66. by Jay Aronson posted to network_flow by NeilInCanadia on 2008-01-21 19:12:06 as
	Constructing Maximal Dynamic Flows from Static Flows [My Copy] Operations Research, Vol. 6, No. 3. (1958), pp. 419-433. by L. R. Ford, D. R. Fulkerson posted to network_flow by NeilInCanadia on 2008-01-21 17:52:37 as
	Flows over time with load-dependent transit times [My Copy] In SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (2002), pp. 174-183. by Ekkehard Köhler, Martin Skutella posted to network_flow by NeilInCanadia on 2008-01-21 17:28:17 as
	Network Flows: Theory, Algorithms, and Applications [My Copy] (18 February 1993) by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin posted to books network_flow selfish_routing by NeilInCanadia on 2007-12-10 05:37:18 as along with 8 people and 1 group rocarvaj cradle25 AbnerCYH ahmadsuyuti nkorf gtdj meatball djlin Semantic-Social-Networks
	An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times [My Copy] Algorithmica, Vol. 47, No. 3. (April 2007), pp. 299-321. by Hall, Alex, Langkau, Katharina, Skutella, Martin posted to network_flow by NeilInCanadia on 2007-10-18 18:58:50 as
	A polynomial-time tree decomposition to minimize congestion [My Copy] In SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures (2003), pp. 34-43. by Chris Harrelson, Kirsten Hildrum, Satish Rao posted to network_flow routing by NeilInCanadia on 2007-10-16 21:26:30 as along with 1 person timos
	A polynomial time approximation scheme for the SONET ring loading problem [My Copy] Bell Labs Technical Journal, Vol. 2, No. 2. (1997), pp. 36-41. by Sanjeev Khanna posted to load_balancing network_flow routing by NeilInCanadia on 2007-10-11 15:10:41 as
	The Ring Loading Problem [My Copy] SIAM Journal on Discrete Mathematics, Vol. 11, No. 1. (1998), pp. 1-14. by Alexander Schrijver, Paul Seymour, Peter Winkler posted to load_balancing network_flow open_problems by NeilInCanadia on 2007-10-01 01:55:29 as
	Hardness of the undirected congestion minimization problem [My Copy] In STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005), pp. 284-293. by Matthew Andrews, Lisa Zhang posted to hardness network_flow by NeilInCanadia on 2007-03-02 17:20:32 as

Note: You may cite this page as: http://www.citeulike.org/tag/network_flow

CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.

Sort by:
Order:	Default Ascending Descending
Empty fields:	Default First Last

traffic	3
approximation	2
load_balancing	2
routing	2
selfish_routing	2
assignment_problem	1
books	1
cut	1
graph	1
hardness	1
interior_point_algorithm	1
linear_programming_techniques	1
maxflow-mincut	1
mobile	1
multicommodity_flow_problem	1
network	1
network_optimization	1
open_problems	1

Tag network_flow [15 articles] Export Sort

Related Tags