Log in

Relevant bibliographies by topics / Multicommodity Flows / Dissertations / Theses

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

Dissertations / Theses 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 35 dissertations / theses 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 dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

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

11

Hägglöf, Kristoffer. "Convex multicommodity flow problems : a bidual approach /." Linköping : Dept. of mathematics, Univ, 2005. http://www.bibl.liu.se/liupubl/disp/disp2005/tek954s.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Stein, Clifford. "Approximation algorithms for multicommodity flow and shop scheduling problems." Thesis, Massachusetts Institute of Technology, 1992. http://hdl.handle.net/1721.1/12867.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1992.<br>Includes bibliographical references (leaves 174-179).<br>by Clifford Stein.<br>Ph.D.

APA, Harvard, Vancouver, ISO, and other styles

13

Say, Fatih. "Minimum Concave Cost Multicommodity Network Design." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/12606432/index.pdf.

Full text

Abstract:

Minimum Concave Cost Multicommodity Network Design Problem arises in many application areas, such as transportation planning, distributed energy system and especially both circuit and packet switching backbone network design. Exact concave optimization algorithms have been developed, but these methods are applicable if the network size is small. Therefore, these problems are usually solved by non-exact iterative methods. In this thesis work, methods proposed for circuit switching and packet switching network design are evaluated in detail. After a comprehensive literate survey, Yaged&rsquo<b

APA, Harvard, Vancouver, ISO, and other styles

14

Hu, Yuanfang. "On-chip interconnection architecture optimization using a multicommodity flow approach." Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2007. http://wwwlib.umi.com/cr/ucsd/fullcit?p3260036.

Full text

Abstract:

Thesis (Ph. D.)--University of California, San Diego, 2007.<br>Title from first page of PDF file (viewed June 27, 2007). Available via ProQuest Digital Dissertations. Vita. Includes bibliographical references (p. 76-81).

APA, Harvard, Vancouver, ISO, and other styles

15

Schneur, Rina. "Scaling algorithms for multicommodity flow problems and network flow problems with side constraits." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13710.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Browne, Christopher B. "Using interior point methods to solve the multicommodity network flow problem." Thesis, University of Ottawa (Canada), 1993. http://hdl.handle.net/10393/6760.

Full text

Abstract:

This thesis explores applications of Interior Point methods as popularized by Karmarkar (36) for solving Multicommodity Network Flow problems (MCNF). In these problems, several commodities must be shipped between various nodes of a network. The goal is to satisfy the shipping requirements at a minimum cost, while respecting processing capacities on the joint flow of commodities. The thesis presents a unified view of current methods for multicommodity networks, from the early formulations to current work that has involved nonlinear and interior point methods. It compares and contrasts some Inte

APA, Harvard, Vancouver, ISO, and other styles

17

Lange, Heinrich. "Solution of large-scale multicommodity network flow problems via a logarithmic barrier function decomposition/." Thesis, Monterey, California. Naval Postgraduate School, 1988. http://hdl.handle.net/10945/23397.

Full text

Abstract:

A new algorithm is presented using a logarithmic barrier function decomposition for the solution of the large-scale multicommodity network flow problem. Placing the complicating joint capacity constraints of the multicommodity network flow problem into a logarithmic barrier term of the objective function creates a nonlinear mathematical program with linear network flow constraints. Using the technique of restricted simplicial decomposition, we generate a sequence of extreme points by solving independent pure network problems for each commodity in a linear subproblem and optimize a nonlinear ma

APA, Harvard, Vancouver, ISO, and other styles

18

Gouveia, Luis, and Thomas L. Magnanti. "Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees." Massachusetts Institute of Technology, Operations Research Center, 2001. http://hdl.handle.net/1721.1/5310.

Full text

Abstract:

The Diameter-Constrained Minimum Spanning Tree Problem seeks a least cost spanning tree subject to a (diameter) bound imposed on the number of edges in the tree between any node pair. A traditional multicommodity flow model with a commodity for every pair of nodes was unable to solve a 20-node and 100-edge problem after one week of computation. We formulate the problem as a directed tree from a selected central node or a selected central edge. Our model simultaneously finds a central node or a central edge and uses it as the source for the commodities in a directed multicommodity flow model wi

APA, Harvard, Vancouver, ISO, and other styles

19

Sa, Shibasaki Rui. "Lagrangian Decomposition Methods for Large-Scale Fixed-Charge Capacitated Multicommodity Network Design Problem." Thesis, Université Clermont Auvergne‎ (2017-2020), 2020. http://www.theses.fr/2020CLFAC024.

Full text

Abstract:

Typiquement présent dans les domaines de la logistique et des télécommunications, le problème de synthèse de réseau multi-flot à charge fixe reste difficile, en particulier dans des contextes à grande échelle. Dans ce cas, la capacité à produire des solutions de bonne qualité dans un temps de calcul raisonnable repose sur la disponibilité d'algorithmes efficaces. En ce sens, cette thèse propose des approches lagrangiennes capables de fournir des bornes relativement proches de l'optimal pour des instances de grande taille. L'efficacité des méthodes dépend de l'algorithme appliqué pour résoudre

APA, Harvard, Vancouver, ISO, and other styles

20

Emanuelsson, Kristoffer. "Approximating multi-commodity max-flow in practice." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193.

Full text

Abstract:

Garg and Könemann developed a framework for computing multi-commodity maximum flow in a graph, later called a multiplicative weight update framework. Madry used this framework and exchanged Dijkstra’s algorithm to a dynamic graph algorithm for approximating the shortest paths through the graph. With this approachhe developed the fastest algorithm to date for calculating the multi-commodity maximum flow, with a running time of Õ(mnϵ2). This project have implemented the algorithm and compared it with a slightly modified version of the former fastest algorithm by Fleischer with a time complexity

APA, Harvard, Vancouver, ISO, and other styles

21

Fajmon, Michal. "Optimalizace a algoritmy pro úlohy dopravního inženýrství." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2020. http://www.nusl.cz/ntk/nusl-417157.

Full text

Abstract:

This master's thesis deals with optimization of traffic networks. There are discussed modeling methods for traffic and simplifications used in these models. Introductory part is focused on mathematical theory used to buid presented model. Main focus of this thesis was creation and optimization of the model which describes real world traffic network with traffic lights. Model was tested on both artificial and real data gathered in city Zlín. It was necessary to create generator which can produce suitable input data for model.

APA, Harvard, Vancouver, ISO, and other styles

22

Moz, Margarida. "Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar." Doctoral thesis, Instituto Superior de Economia e Gestão, 2003. http://hdl.handle.net/10400.5/3617.

Full text

Abstract:

Doutoramento em Matemática Aplicada à Economia e à Gestão<br>O objectivo desta dissertação é resolver um problema de escalonamento de pessoal em contexto hospitalar - o problema de substituição de pessoal em falta a escalas de serviço, aplicando técnicas de Investigação Operacional. Este problema consiste em reconstruir os planos de escalas quando acontecimentos inesperados impedem que uma ou mais enfermeiras executem tarefas que lhes estavam atribuídas. O novo plano de esclas tem de satisfazer os requisitos mínimos exigidos para o funcionamento do serviço, as normas instituídas pela administr

APA, Harvard, Vancouver, ISO, and other styles

23

Garg, Naveen. "Multicommodity flows and approximation algorithms." Thesis, 1994. http://localhost:8080/iit/handle/2074/2226.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Alvelos, Filipe Pereira e. "Branch-and-price and multicommodity flows." Doctoral thesis, 2005. http://hdl.handle.net/1822/2736.

Full text

Abstract:

Tese de doutoramento em Engenharia de Produção e Sistemas, área de Investigação Operacional<br>In this Thesis, we address column generation based methods for linear and integer programming and apply them to three multicommodity flow problems. For (mixed) integer programming problems, the approach taken consists in reformulating an original model, using the Dantzig-Wolfe decomposition principle, and then combining column generation with branch-and-bound (branch-and-price) in order to obtain optimal solutions. The main issue when developing a branch-and-price algorithm is the branching scheme.

APA, Harvard, Vancouver, ISO, and other styles

25

Mohapatra, Chinmoy. "Multicommodity network flow models with FIFO transshipment handling policies." Thesis, 2011. http://hdl.handle.net/2152/ETD-UT-2011-08-4114.

Full text

Abstract:

Integer multicommodity network flow (MCNF) models have applications in various areas like logistics, freight transportation, telecommunication and manufacturing. In this thesis we study an extension of the integer MCNF problem (MCNF-FIFO) where commodities are handled (processed) in a first-in-first-out (FIFO) order at each transshipment location and resource capacities are shared across arcs in the network. The objective of the MCNF-FIFO model is to find feasible routes for all commodities from their origins to destinations while minimizing the total transportation and holding cost or the sum

APA, Harvard, Vancouver, ISO, and other styles

26

Chika, Satoko. "Using maximum and maximum concurrent multicommodity flows for QoS routing in the internet." 2007. http://digital.library.okstate.edu/etd/umi-okstate-2352.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Kramer, Jeremy D. "Min-cost multicommodity network flows a linear case for the convergence and reoptimization of multiple single commodity network flows /." 2009. http://www.lib.ncsu.edu/theses/available/etd-04242009-204158/unrestricted/etd.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Sensen, Norbert [Verfasser]. "Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows / von Norbert Sensen." 2003. http://d-nb.info/971568243/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

"Improved Bi-criteria Approximation for the All-or-Nothing Multicommodity Flow Problem in Arbitrary Networks." Master's thesis, 2020. http://hdl.handle.net/2286/R.I.62685.

Full text

Abstract:

abstract: This thesis addresses the following fundamental maximum throughput routing problem: Given an arbitrary edge-capacitated n-node directed network and a set of k commodities, with source-destination pairs (s_i,t_i) and demands d_i> 0, admit and route the largest possible number of commodities -- i.e., the maximum throughput -- to satisfy their demands. The main contributions of this thesis are three-fold: First, a bi-criteria approximation algorithm is presented for this all-or-nothing multicommodity flow (ANF) problem. This algorithm is the first to achieve a constant approximation o

APA, Harvard, Vancouver, ISO, and other styles

30

Correa, Jose R., Andreas S. Schulz, and Moses Nicolas E. Stier. "Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem." 2004. http://hdl.handle.net/1721.1/5051.

Full text

Abstract:

We study the problem of minimizing the maximum latency of flows in networks with congestion. We show that this problem is NP-hard, even when all arc latency functions are linear and there is a single source and sink. Still, one can prove that an optimal flow and an equilibrium flow share a desirable property in this situation: all flow-carrying paths have the same length; i.e., these solutions are "fair," which is in general not true for the optimal flow in networks with nonlinear latency functions. In addition, the maximum latency of the Nash equilibrium, which can be computed efficiently, is

APA, Harvard, Vancouver, ISO, and other styles

31

Harvey, Nicholas J., Robert D. Kleinberg, and April Rasala Lehman. "Comparing Network Coding with Multicommodity Flow for the k-pairs Communication Problem." 2004. http://hdl.handle.net/1721.1/30508.

Full text

Abstract:

Given a graph G = (V,E) and k source-sink pairs of vertices, this papers investigates the maximum rate r at which all pairs can simultaneously communicate. We view this problem from two perspectives and compare their advantages. In the multicommodity flow formulation, a solution provides dedicated bandwidth r between each source-sink pair. In the information flow formulation, a vertex can transmit a function of the information it received thereby allowing multiple source-sink pairs to share bandwidth. For directed acyclic graphs with n vertices, we show that the rate achievable in the informat

APA, Harvard, Vancouver, ISO, and other styles

32

Du, Ying. "Approximation algorithms for multicommodity flow and normalized cut problems implementations and experimental study /." 2004. http://etd.nd.edu.lib-proxy.nd.edu/ETD-db/theses/available/etd-04062004-144512/.

Full text

Abstract:

Thesis (M.S.)--University of Notre Dame, 2004.<br>Thesis directed by Danny Z. Chen for the Department of Computer Science and Engineering. "April 2004." Includes bibliographical references (leaves 53-54).

APA, Harvard, Vancouver, ISO, and other styles

33

Yu, Louis Lei. "Multicommodity flow applied to the utility model: a heuristic approach to service level agreements in packet networks." Thesis, 2005. http://hdl.handle.net/1828/52.

Full text

Abstract:

Consider the concept of the Utility Model [5]: the optimal allocation of resources of a server or network while meeting the absolute Quality of Service (QoS) requirements of users' multimedia sessions. Past algorithms and heuristics to solve the Utility Model mapped the problem onto a variant of the Combinatorial Knapsack Problem, with server utility (e.g. revenue) as the quantity to be optimized and with user QoS requirements expressed as constraints on the resource allocation. Both optimal (algorithmic) and fast but sub-optimal (heuristic) methods were derived to solve the resulting Multidim

APA, Harvard, Vancouver, ISO, and other styles

34

Bernardino, Raquel. "The family traveling salesman problem." Doctoral thesis, 2019. http://hdl.handle.net/10451/42303.

Full text

Abstract:

Consider a depot, a partition of the set of nodes into subsets, called families, and a cost matrix. The objective of the family traveling salesman problem (FTSP) is to find the minimum cost circuit that starts and ends at the depot and visits a given number of nodes per family. The FTSP was motivated by the order picking problem in warehouses where products of the same type are stored in different places and it is a recent problem. Nevertheless, the FTSP is an extension of well-known problems, such as the traveling salesman problem. Since the benchmark instances available are in small number

APA, Harvard, Vancouver, ISO, and other styles

35

Λακουμέντας, Ιωάννης. "Δρομολόγηση και ανάθεση συχνοτήτων σε WDM οπτικά δίκτυα". Thesis, 2006. http://nemertes.lis.upatras.gr/jspui/handle/10889/533.

Full text

Abstract:

Η δρομολόγηση και ανάθεση μηκών κύματος (routing and wavelength assignment - RWA) αποτελεί ένα πολύ σημαντικό πρόβλημα, που απασχολεί τους σχεδιαστές WDM οπτικών δικτύων και είναι γνωστό, πως είναι NP-πλήρες. Στην εργασία αυτή σχεδιάζουμε και υλοποιούμε έναν αλγόριθμο για το στατικό RWA, που βασίζεται σε έναν προτεινόμενο σχηματισμό (μη ακέραιου) γραμμικού προγραμματισμού (linear programming - LP). Ισχυριζόμαστε, πως ο σχηματισμός αυτός είναι σε θέση να παρέχει ακέραιες βέλτιστες λύσεις (παρά την εν γένει μη ακέραια φύση του) για ένα μεγάλο ποσοστό στιγμιότυπων εισόδου, οδηγώντας έτσι σε αντίσ

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!