Relevant bibliographies by topics / Multicommodity Flows

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Multicommodity Flows'

Author: Grafiati
Published: 4 June 2021
Last updated: 25 May 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Multicommodity Flows.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Multicommodity Flows"

1

Király, Tamás, and Júlia Pap. "Stable Multicommodity Flows." Algorithms 6, no. 1 (2013): 161–68. http://dx.doi.org/10.3390/a6010161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Yu, B., J. Cheriyan, and P. E. Haxell. "Hypercubes and Multicommodity Flows." SIAM Journal on Discrete Mathematics 10, no. 2 (1997): 190–200. http://dx.doi.org/10.1137/s089548019426560x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Seymour, Paul. "Criticality for multicommodity flows." Journal of Combinatorial Theory, Series B 110 (January 2015): 136–79. http://dx.doi.org/10.1016/j.jctb.2014.08.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vachani, Rita, Alexander Shulman, Peter Kubat, and Julie Ward. "Multicommodity Flows in Ring Networks." INFORMS Journal on Computing 8, no. 3 (1996): 235–42. http://dx.doi.org/10.1287/ijoc.8.3.235.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Myung, Young-Soo. "Multicommodity flows in cycle graphs." Discrete Applied Mathematics 154, no. 11 (2006): 1615–21. http://dx.doi.org/10.1016/j.dam.2006.03.016.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Herty, M., C. Kirchner, S. Moutari, and M. Rascle. "Multicommodity flows on road networks." Communications in Mathematical Sciences 6, no. 1 (2008): 171–87. http://dx.doi.org/10.4310/cms.2008.v6.n1.a8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Y. L., and Y. H. Chin. "Multicommodity Network Flows with Safety Considerations." Operations Research 40, no. 1-supplement-1 (1992): S48—S55. http://dx.doi.org/10.1287/opre.40.1.s48.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Karzanov, A. V. "Polyhedra related to undirected multicommodity flows." Linear Algebra and its Applications 114-115 (March 1989): 293–328. http://dx.doi.org/10.1016/0024-3795(89)90468-0.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Afraimovich, L. G., and M. Kh Prilutskii. "Multicommodity flows in tree-like networks." Journal of Computer and Systems Sciences International 47, no. 2 (2008): 214–20. http://dx.doi.org/10.1134/s106423070802007x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Lozovanu, Dmitrii, and Maria Fonoberova. "Optimal Dynamic Multicommodity Flows in Networks." Electronic Notes in Discrete Mathematics 25 (August 2006): 93–100. http://dx.doi.org/10.1016/j.endm.2006.06.087.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Multicommodity Flows"

1

Wang, I.-Lin. "Shortest paths and multicommodity network flows." Diss., Georgia Institute of Technology, 2003. http://hdl.handle.net/1853/23304.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Withers, Paul Nigel. "Uniform multicommodity flows in random networks." Thesis, University of Oxford, 2015. https://ora.ox.ac.uk/objects/uuid:f7e79942-400d-4d2a-af78-bf0427e6d0d6.

Full text
Abstract:
Given a network N, and a collection V of unordered pairs of vertices in N, a corresponding uniform multicommodity flow F of volume φ consists of simultaneous flows of volume φ of unique commodities between each pair of vertices in V. The maximum uniform flow volume is the maximum value of φ such that there is a uniform multicommodity flow of volume φ in N, within the capacity constraints. This thesis considers networks with random edge-capacities. Multicommodity flows are of interest in operational research and combinatorial optimisation and sampling. They have been studied extensively from a
APA, Harvard, Vancouver, ISO, and other styles
3

Torres, Guardia Luis Ernesto, and Lima Gilson Alvez. "Interior point methods for multicommodity network flows." Pontificia Universidad Católica del Perú, 2014. http://repositorio.pucp.edu.pe/index/handle/123456789/95524.

Full text
Abstract:
This article studies the linear multicommodity network flow problem. This kind of problem arises in a wide variety of contexts. A numerical implementation of the primal-dual interior-point method is designed to solve the problem. In the interior-point method, at each iteration, the corresponding linear system, expressed as a normal equations system, is solved by using the AINV algorithm combined with a preconditioned conjugate gradient algorithm or by the AINV algorithm for the whole normal equations. Numerical experiments are conducted for networks of different dimensions and numbers of produ
APA, Harvard, Vancouver, ISO, and other styles
4

Nagamochi, Hiroshi. "Studies on Multicommodity Flows in Directed Networks." Kyoto University, 1988. http://hdl.handle.net/2433/74707.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Zhang, Pengfei, and Neng Fan. "Analysis of budget for interdiction on multicommodity network flows." Springer, 2016. http://hdl.handle.net/10150/623040.

Full text
Abstract:
In this paper, we concentrate on computing several critical budgets for interdiction of the multicommodity network flows, and studying the interdiction effects of the changes on budget. More specifically, we first propose general interdiction models of the multicommodity flow problem, with consideration of both node and arc removals and decrease of their capacities. Then, to perform the vulnerability analysis of networks, we define the function F(R) as the minimum amount of unsatisfied demands in the resulted network after worst-case interdiction with budget R. Specifically, we study the prope
APA, Harvard, Vancouver, ISO, and other styles
6

Daly, Matthew Sean. "State space partition techniques for multiterminal and multicommodity flows in stochastic networks." Diss., Georgia Institute of Technology, 2001. http://hdl.handle.net/1853/25637.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Sensen, Norbert. "Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows." [S.l. : s.n.], 2003. http://deposit.ddb.de/cgi-bin/dokserv?idn=971568243.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Kramer, Jeremy Daniel. "Min-Cost Multicommodity Network Flows: A Linear Case for the Convergence and Reoptimization of Multiple Single-Commodity Network Flows." NCSU, 2009. http://www.lib.ncsu.edu/theses/available/etd-04242009-204158/.

Full text
Abstract:
Network Flow problems are prevalent in Operations Research, Computer Science, Industrial Engineering and Management Science. They constitute a class of problems that are frequently faced by real world applications, including transportation, telecommunications, production planning, etc. While many problems can be modeled as Network Flows, these problems can quickly become unwieldy in size and difficult to solve. One particularly large instance is the Min-Cost Multicommodity Network Flow problem. Due to the time-sensitive nature of the industry, faster algorithms are always desired: recent advan
APA, Harvard, Vancouver, ISO, and other styles
9

Lefebvre, Thibaut. "Optimization of information flows in telecommunication networks." Thesis, Paris, CNAM, 2016. http://www.theses.fr/2016CNAM1053/document.

Full text
Abstract:
Dans les réseaux de télécommunications, la demande croissante pour de nouveaux services, comme la diffusion de vidéos en continu ou les conférences en ligne, engendre un besoin pour des dispositifs de télécommunication où le même contenu est acheminé depuis un émetteur unique vers un groupe de récepteurs. Cette évolution ouvre la voie au développement de nouvelles techniques d'acheminement des données, comme le multicast qui laisse un nœud du réseau copier ses données d'entrée puis retransmettre ces copies, ou le codage réseau, qui est une technique permettant à un nœud d'effectuer des opérati
APA, Harvard, Vancouver, ISO, and other styles
10

Lefebvre, Thibaut. "Optimization of information flows in telecommunication networks." Electronic Thesis or Diss., Paris, CNAM, 2016. http://www.theses.fr/2016CNAM1053.

Full text
Abstract:
Dans les réseaux de télécommunications, la demande croissante pour de nouveaux services, comme la diffusion de vidéos en continu ou les conférences en ligne, engendre un besoin pour des dispositifs de télécommunication où le même contenu est acheminé depuis un émetteur unique vers un groupe de récepteurs. Cette évolution ouvre la voie au développement de nouvelles techniques d'acheminement des données, comme le multicast qui laisse un nœud du réseau copier ses données d'entrée puis retransmettre ces copies, ou le codage réseau, qui est une technique permettant à un nœud d'effectuer des opérati
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Multicommodity Flows"

1

Schneur, Rina. A scaling algorithm for multicommodity flow problems. Alfred P. Sloan School of Management, Massachusetts Institute of Technology, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

T, Leighton, ed. Fast approximation algorithms for multicommodity flow problems. Dept. of Computer Science, Stanford University, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Goldberg, Andrew V. A natural randomization strategy for multicommodity flow and related algorithms. Dept. of Computer Science, Stanford University, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Aikens, C. Harold. A fixed-charge multicommodity network flow algorithm and a warehouse location application. Naval Postgradute School, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Lange, Heinrich. Solution of large-scale multicommodity network flow problems via a logarithmic barrier function decomposition. Naval Postgraduate School, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Mehrgüterflüsse: Multicommodity Flows. diplom.de, 2014.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Modeling and Analysis of Multicommodity Network Flows via Goal Programming. Storming Media, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Farvolden, Judith Margaret. A PRIMAL PARTITIONING SOLUTION FOR MULTICOMMODITY NETWORK FLOW PROBLEMS. 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Multicommodity Flows"

1

Eiselt, H. A., and C. L. Sandblom. "Multicommodity Network Flows." In Integer Programming and Network Models. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-04197-0_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shetty, Bala. "Multicommodity Network Flows." In Encyclopedia of Operations Research and Management Science. Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_645.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Korte, Bernhard, and Jens Vygen. "Multicommodity Flows and Edge-Disjoint Paths." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24488-9_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Korte, Bernhard, and Jens Vygen. "Multicommodity Flows and Edge-Disjoint Paths." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2000. http://dx.doi.org/10.1007/978-3-662-21708-5_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Korte, Bernhard, and Jens Vygen. "Multicommodity Flows and Edge-Disjoint Paths." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/978-3-662-21711-5_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Srivastav, Anand, and Peter Stangier. "Integer multicommodity flows with reduced demands." In Algorithms—ESA '93. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57273-2_71.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Weihe, Karsten. "Multicommodity flows in even, planar networks." In Algorithms and Computation. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57568-5_264.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Korte, Bernhard, and Jens Vygen. "Multicommodity Flows and Edge-Disjoint Paths." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2018. http://dx.doi.org/10.1007/978-3-662-56039-6_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Awerbuch, Baruch, and Tom Leighton. "Multicommodity flows: A survey of recent research." In Algorithms and Computation. Springer Berlin Heidelberg, 1993. http://dx.doi.org/10.1007/3-540-57568-5_260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Günlük, Oktay. "A New Min-Cut Max-Flow Ratio for Multicommodity Flows." In Integer Programming and Combinatorial Optimization. Springer Berlin Heidelberg, 2002. http://dx.doi.org/10.1007/3-540-47867-1_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Multicommodity Flows"

1

Kelner, Jonathan A., Gary L. Miller, and Richard Peng. "Faster approximate multicommodity flow using quadratically coupled flows." In the 44th symposium. ACM Press, 2012. http://dx.doi.org/10.1145/2213977.2213979.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Awerbuch, Baruch, and Rohit Khandekar. "Distributed network monitoring and multicommodity flows." In the twenty-sixth annual ACM symposium. ACM Press, 2007. http://dx.doi.org/10.1145/1281100.1281141.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Awerbuch, Baruch, and Rohit Khandekar. "Greedy distributed optimization of unsplittable multicommodity flows." In the twenty-seventh ACM symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1400751.1400834.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Chekuri, Chandra, Sreeram Kannan, Adnan Raja, and Pramod Viswanath. "Multicommodity flows and cuts in polymatroidal networks." In the 3rd Innovations in Theoretical Computer Science Conference. ACM Press, 2012. http://dx.doi.org/10.1145/2090236.2090268.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Awerbuch, Baruch, and Rohit Khandekar. "Stateless distributed algorithms for near optimal maximum multicommodity flows." In the twenty-seventh ACM symposium. ACM Press, 2008. http://dx.doi.org/10.1145/1400751.1400835.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Parodi, Cecilia, Franco Robledo, Pablo Romero, and Carlos Testuri. "Optimal multicommodity flows over an existing DWDM multi-overlay." In 2015 7th IEEE Latin-American Conference on Communications (LATINCOM). IEEE, 2015. http://dx.doi.org/10.1109/latincom.2015.7430120.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Kapoor, S., and P. M. Vaidya. "Fast algorithms for convex quadratic programming and multicommodity flows." In the eighteenth annual ACM symposium. ACM Press, 1986. http://dx.doi.org/10.1145/12130.12145.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Velichko, Andrey, Valeriya Gribova, and Leonid Fedorishchev. "Simulation Software for Multicommodity Flows Model of Interregional Trade." In 2018 3rd Russian-Pacific Conference on Computer Technology and Applications (RPC). IEEE, 2018. http://dx.doi.org/10.1109/rpc.2018.8482140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Suzuki, H., T. Nishizeki, and N. Saito. "Multicommodity flows in planar undirected graphs and shortest paths." In the seventeenth annual ACM symposium. ACM Press, 1985. http://dx.doi.org/10.1145/22145.22167.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Plotkin, Serge A., and Éva Tardos. "Improved bounds on the max-flow min-cut ratio for multicommodity flows." In the twenty-fifth annual ACM symposium. ACM Press, 1993. http://dx.doi.org/10.1145/167088.167263.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Multicommodity Flows"

1

Goldberg, Andrew V. A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms. Defense Technical Information Center, 1991. http://dx.doi.org/10.21236/ada254368.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Leighton, Tom, and Satish Rao. An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada211908.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Multicommodity Flows' for particular source types:
Journal articles Dissertations / Theses
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography