Log in

Relevant bibliographies by topics / Multicommodity Flows / Journal articles

To see the other types of publications on this topic, follow the link: Multicommodity Flows.

Journal articles 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 top 50 journal articles for your research 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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

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

11

Schrijver, A. "The Klein bottle and multicommodity flows." Combinatorica 9, no. 4 (1989): 375–84. http://dx.doi.org/10.1007/bf02125349.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Weihe, K. "Multicommodity Flows in Even, Planar Networks." Algorithmica 18, no. 3 (1997): 363. http://dx.doi.org/10.1007/pl00009161.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Elmallah, E. S., and J. C. Culberson. "Multicommodity flows in simple multistage networks." Networks 25, no. 1 (1995): 19–30. http://dx.doi.org/10.1002/net.3230250104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Khanal, Durga Prasad, Urmila Pyakurel, and Tanka Nath Dhamala. "Maximum Multicommodity Flow with Intermediate Storage." Mathematical Problems in Engineering 2021 (July 20, 2021): 1–11. http://dx.doi.org/10.1155/2021/5063207.

Full text

Abstract:

The multicommodity flow problem deals with the transshipment of more than one commodity from respective sources to corresponding sinks without violating the capacity constraints. Due to the capacity constraints, flows out from the sources may not reach their sinks, and so, the storage of excess flows at intermediate nodes plays an important role in the maximization of flow values. In this paper, we introduce the maximum static as well as maximum dynamic multicommodity flow problems with intermediate storage. We present polynomial and pseudopolynomial time algorithms for the former and latter p

APA, Harvard, Vancouver, ISO, and other styles

15

Mahey, Philippe, and Mauricio C. de Souza. "MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS." Pesquisa Operacional 37, no. 3 (2017): 571–95. http://dx.doi.org/10.1590/0101-7438.2017.037.03.0571.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Chekuri, Chandra, Sreeram Kannan, Adnan Raja, and Pramod Viswanath. "Multicommodity Flows and Cuts in Polymatroidal Networks." SIAM Journal on Computing 44, no. 4 (2015): 912–43. http://dx.doi.org/10.1137/130906830.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Hurkens, C. A. J., A. Schrijver, and É. Tardos. "On fractional multicommodity flows and distance functions." Discrete Mathematics 73, no. 1-2 (1988): 99–109. http://dx.doi.org/10.1016/0012-365x(88)90137-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Suzuki, Hitoshi, Takao Nishizeki, and Nobuji Saito. "Algorithms for multicommodity flows in planar graphs." Algorithmica 4, no. 1-4 (1989): 471–501. http://dx.doi.org/10.1007/bf01553903.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Schrijver, A. "Short proofs on multicommodity flows and cuts." Journal of Combinatorial Theory, Series B 53, no. 1 (1991): 32–39. http://dx.doi.org/10.1016/0095-8956(91)90052-l.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Nagamochi, Hiroshi, and Toshihide Ibaraki. "Multicommodity flows in certain planar directed networks." Discrete Applied Mathematics 27, no. 1-2 (1990): 125–45. http://dx.doi.org/10.1016/0166-218x(90)90134-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Kapoor, Sanjiv, and Pravin M. Vaidya. "Speeding up Karmarkar's algorithm for multicommodity flows." Mathematical Programming 73, no. 1 (1996): 111–27. http://dx.doi.org/10.1007/bf02592100.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Bienstock, Daniel, Sunil Chopra, Oktay Günlük, and Chih-Yang Tsai. "Minimum cost capacity installation for multicommodity network flows." Mathematical Programming 81, no. 2 (1998): 177–99. http://dx.doi.org/10.1007/bf01581104.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Hall, Alex, Steffen Hippler, and Martin Skutella. "Multicommodity flows over time: Efficient algorithms and complexity." Theoretical Computer Science 379, no. 3 (2007): 387–404. http://dx.doi.org/10.1016/j.tcs.2007.02.046.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Aggarwal, A. K., M. Oblak, and R. R. Vemuganti. "A heuristic solution procedure for multicommodity integer flows." Computers & Operations Research 22, no. 10 (1995): 1075–87. http://dx.doi.org/10.1016/0305-0548(94)00085-m.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Srivastav, Anand, and Peter Stangier. "On complexity, representation and approximation of integral multicommodity flows." Discrete Applied Mathematics 99, no. 1-3 (2000): 183–208. http://dx.doi.org/10.1016/s0166-218x(99)00133-x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Jones, Kim L., Irvin J. Lustig, Judith M. Farvolden, and Warren B. Powell. "Multicommodity network flows: The impact of formulation on decomposition." Mathematical Programming 62, no. 1-3 (1993): 95–117. http://dx.doi.org/10.1007/bf01585162.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Wang, Di, and Robert Kleinberg. "Analyzing quadratic unconstrained binary optimization problems via multicommodity flows." Discrete Applied Mathematics 157, no. 18 (2009): 3746–53. http://dx.doi.org/10.1016/j.dam.2009.07.009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Castro, Jordi. "A Specialized Interior-Point Algorithm for Multicommodity Network Flows." SIAM Journal on Optimization 10, no. 3 (2000): 852–77. http://dx.doi.org/10.1137/s1052623498341879.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Zhang, Pengfei, and Neng Fan. "Analysis of budget for interdiction on multicommodity network flows." Journal of Global Optimization 67, no. 3 (2016): 495–525. http://dx.doi.org/10.1007/s10898-016-0422-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Castro, J., and N. Nabona. "An implementation of linear and nonlinear multicommodity network flows." European Journal of Operational Research 92, no. 1 (1996): 37–53. http://dx.doi.org/10.1016/0377-2217(95)00137-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Lari, Ali Reza, and Barin N. Nag. "A model management solution system for multicommodity network flows." European Journal of Operational Research 71, no. 3 (1993): 398–418. http://dx.doi.org/10.1016/0377-2217(93)90349-r.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Avis, David, and Michel Deza. "The cut cone,L1 embeddability, complexity, and multicommodity flows." Networks 21, no. 6 (1991): 595–617. http://dx.doi.org/10.1002/net.3230210602.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Katayama, Naoto. "MIP Neighborhood Search Heuristics for a Capacitated Fixed-Charge Network Design Problem." Asia-Pacific Journal of Operational Research 37, no. 03 (2020): 2050009. http://dx.doi.org/10.1142/s0217595920500098.

Full text

Abstract:

The fixed-charge capacitated multicommodity network design problem is a fundamental optimization problem arising in many network configurations. The solution of the problem provides an appropriate network design as well as routes of multicommodity flows aimed at minimizing the total cost, which is the sum of the flow costs and fixed-charge costs over a network with limited arc capacities. In the present paper, we introduce a combined approach with a capacity scaling procedure for finding an initial feasible solution and an MIP neighborhood search for improving the solutions. Besides, we modify

APA, Harvard, Vancouver, ISO, and other styles

34

Chaturvedi, Anya, Chandra Chekuri, Andr´ea W. Richa, Matthias Rost, Stefan Schmid, and Jamison Weber. "Improved Throughput for All-or-Nothing Multicommodity Flows with Arbitrary Demands." ACM SIGMETRICS Performance Evaluation Review 49, no. 3 (2022): 22–27. http://dx.doi.org/10.1145/3529113.3529121.

Full text

Abstract:

Throughput is a main performance objective in communication networks. This paper considers a fundamental maximum throughput routing problem-the all-or-nothing multicommodity flow (ANF) problem - in arbitrary directed graphs and in the practically relevant but challenging setting where demands can be (much) larger than the edge capacities. Hence, in addition to assigning requests to valid flows for each routed commodity, an admission control mechanism is required which prevents overloading the network when routing commodities.

APA, Harvard, Vancouver, ISO, and other styles

35

Balakrishnan, Anantaram, Prakash Mirchandani, and Sifeng Lin. "Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models." Operations Research 70, no. 2 (2022): 690–714. http://dx.doi.org/10.1287/opre.2021.2155.

Full text

Abstract:

Modeling Crew Assignments for Urban Transport Services Using Differentiated Flows Public transit agencies need to judiciously deploy their limited crew members to operate numerous daily scheduled services, while meeting duty and working time regulations for each crew member. Since crew costs account for a large portion of the organizations’ operating expenses, minimizing the total crew and transfer costs is very important. But, with hundreds of daily trips and millions of possible crew itineraries, optimizing trip-to-crew assignment decisions is challenging. In “Crew Assignment with Duty Time

APA, Harvard, Vancouver, ISO, and other styles

36

Hirai, Hiroshi, and Shungo Koichi. "On duality and fractionality of multicommodity flows in directed networks." Discrete Optimization 8, no. 3 (2011): 428–45. http://dx.doi.org/10.1016/j.disopt.2011.03.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Oğuz, Murat, Tolga Bektaş, and Julia A. Bennell. "Multicommodity flows and Benders decomposition for restricted continuous location problems." European Journal of Operational Research 266, no. 3 (2018): 851–63. http://dx.doi.org/10.1016/j.ejor.2017.11.033.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Lee, Kyungsik. "Integral polyhedra related to integer multicommodity flows on a cycle." Discrete Applied Mathematics 158, no. 3 (2010): 235–38. http://dx.doi.org/10.1016/j.dam.2009.09.022.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Günlük, Oktay. "A New Min‐Cut Max‐Flow Ratio for Multicommodity Flows." SIAM Journal on Discrete Mathematics 21, no. 1 (2007): 1–15. http://dx.doi.org/10.1137/s089548010138917x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Matsumoto, Kazuhiko, Takao Nishizeki, and Nobuji Saito. "An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks." SIAM Journal on Computing 14, no. 2 (1985): 289–302. http://dx.doi.org/10.1137/0214023.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Scott, Matthew, Richard Deckro, and James Chrissis. "Modeling and Analysis of Multicommodity Network Flows Via Goal Programming." INFOR: Information Systems and Operational Research 43, no. 2 (2005): 93–110. http://dx.doi.org/10.1080/03155986.2005.11732719.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

McDiarmid, Colin, Alex Scott, and Paul Withers. "Uniform multicommodity flows in the hypercube with random edge-capacities." Random Structures & Algorithms 50, no. 3 (2016): 437–63. http://dx.doi.org/10.1002/rsa.20672.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Ciurria-Infosino, Iara, Frieda Granot, and Arthur F. Veinott. "Substitutes, complements, and ripples in multicommodity flows on suspension graphs." Networks 64, no. 2 (2014): 65–75. http://dx.doi.org/10.1002/net.21557.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Pyakurel, Urmila, Shiva Prakash Gupta, Durga Prasad Khanal, and Tanka Nath Dhamala. "Efficient Algorithms on Multicommodity Flow over Time Problems with Partial Lane Reversals." International Journal of Mathematics and Mathematical Sciences 2020 (October 30, 2020): 1–13. http://dx.doi.org/10.1155/2020/2676378.

Full text

Abstract:

The multicommodity flow problem arises when several different commodities are transshipped from specific supply nodes to the corresponding demand nodes through the arcs of an underlying capacity network. The maximum flow over time problem concerns to maximize the sum of commodity flows in a given time horizon. It becomes the earliest arrival flow problem if it maximizes the flow at each time step. The earliest arrival transshipment problem is the one that satisfies specified supplies and demands. These flow over time problems are computationally hard. By reverting the orientation of lanes towa

APA, Harvard, Vancouver, ISO, and other styles

45

Ward, Julie A. "Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks." Mathematics of Operations Research 24, no. 1 (1999): 106–29. http://dx.doi.org/10.1287/moor.24.1.106.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Hajiaghayi, M. T., and Tom Leighton. "On the max-flow min-cut ratio for directed multicommodity flows." Theoretical Computer Science 352, no. 1-3 (2006): 318–21. http://dx.doi.org/10.1016/j.tcs.2005.10.037.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Hall, Alex, Katharina Langkau, and Martin Skutella. "An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times." Algorithmica 47, no. 3 (2007): 299–321. http://dx.doi.org/10.1007/s00453-006-0196-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Kolman, Petr, and Christian Scheideler. "Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing." Theory of Computing Systems 53, no. 2 (2013): 341–63. http://dx.doi.org/10.1007/s00224-013-9454-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Castro, Jordi, and Jordi Cuesta. "Improving an interior-point algorithm for multicommodity flows by quadratic regularizations." Networks 59, no. 1 (2011): 117–31. http://dx.doi.org/10.1002/net.20483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

Suzuki, Hitoshi, Takao Nishizeki, and Nobuji Saito. "An algorithm for multicommodity flows in a class of planar networks." Electronics and Communications in Japan (Part I: Communications) 70, no. 2 (1987): 11–18. http://dx.doi.org/10.1002/ecja.4410700202.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!