Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(Multicommodity Flow). Showing records 1 – 10 of 10 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Kansas State University

1. Orangi-Fard, Negar. Maximum concurrent flow problems and p-modulus.

Degree: PhD, Department of Mathematics, 2020, Kansas State University

 Maximum flow problems involve finding a feasible flow of maximum value through a single source-sink flow network. The flow must satisfy the restriction that the… (more)

Subjects/Keywords: Modulus; Maximum concurrent flow problem; Maximum multicommodity flow problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Orangi-Fard, N. (2020). Maximum concurrent flow problems and p-modulus. (Doctoral Dissertation). Kansas State University. Retrieved from http://hdl.handle.net/2097/40749

Chicago Manual of Style (16th Edition):

Orangi-Fard, Negar. “Maximum concurrent flow problems and p-modulus.” 2020. Doctoral Dissertation, Kansas State University. Accessed November 26, 2020. http://hdl.handle.net/2097/40749.

MLA Handbook (7th Edition):

Orangi-Fard, Negar. “Maximum concurrent flow problems and p-modulus.” 2020. Web. 26 Nov 2020.

Vancouver:

Orangi-Fard N. Maximum concurrent flow problems and p-modulus. [Internet] [Doctoral dissertation]. Kansas State University; 2020. [cited 2020 Nov 26]. Available from: http://hdl.handle.net/2097/40749.

Council of Science Editors:

Orangi-Fard N. Maximum concurrent flow problems and p-modulus. [Doctoral Dissertation]. Kansas State University; 2020. Available from: http://hdl.handle.net/2097/40749


Georgia Tech

2. Xu, Sheng. Combined objective least squares and long step primal dual subproblem simplex methods.

Degree: PhD, Industrial and Systems Engineering, 2016, Georgia Tech

 The first part of this research work is based on Combined Objective Least Squares (COLS). We took a deeper look at matrix decomposition algorithms that… (more)

Subjects/Keywords: Combined objective least squares; Long step primal dual subproblem simplex method; Multicommodity flow

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Xu, S. (2016). Combined objective least squares and long step primal dual subproblem simplex methods. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/58185

Chicago Manual of Style (16th Edition):

Xu, Sheng. “Combined objective least squares and long step primal dual subproblem simplex methods.” 2016. Doctoral Dissertation, Georgia Tech. Accessed November 26, 2020. http://hdl.handle.net/1853/58185.

MLA Handbook (7th Edition):

Xu, Sheng. “Combined objective least squares and long step primal dual subproblem simplex methods.” 2016. Web. 26 Nov 2020.

Vancouver:

Xu S. Combined objective least squares and long step primal dual subproblem simplex methods. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2020 Nov 26]. Available from: http://hdl.handle.net/1853/58185.

Council of Science Editors:

Xu S. Combined objective least squares and long step primal dual subproblem simplex methods. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/58185


Brno University of Technology

3. Fajmon, Michal. Optimalizace a algoritmy pro úlohy dopravního inženýrství: Optimization and algorithms for traffic engineering problems.

Degree: 2020, Brno University of Technology

 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… (more)

Subjects/Keywords: tok v sieti; viackomoditký tok; lineárne programovanie; optimalizácia dopravy; model s diskrétnym časom; network flow; multicommodity flow; linear programming; traffic optimization; discrete-time model

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Fajmon, M. (2020). Optimalizace a algoritmy pro úlohy dopravního inženýrství: Optimization and algorithms for traffic engineering problems. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/192386

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Fajmon, Michal. “Optimalizace a algoritmy pro úlohy dopravního inženýrství: Optimization and algorithms for traffic engineering problems.” 2020. Thesis, Brno University of Technology. Accessed November 26, 2020. http://hdl.handle.net/11012/192386.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Fajmon, Michal. “Optimalizace a algoritmy pro úlohy dopravního inženýrství: Optimization and algorithms for traffic engineering problems.” 2020. Web. 26 Nov 2020.

Vancouver:

Fajmon M. Optimalizace a algoritmy pro úlohy dopravního inženýrství: Optimization and algorithms for traffic engineering problems. [Internet] [Thesis]. Brno University of Technology; 2020. [cited 2020 Nov 26]. Available from: http://hdl.handle.net/11012/192386.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Fajmon M. Optimalizace a algoritmy pro úlohy dopravního inženýrství: Optimization and algorithms for traffic engineering problems. [Thesis]. Brno University of Technology; 2020. Available from: http://hdl.handle.net/11012/192386

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Delft University of Technology

4. Kalicharan, Kishan (author). Intermodal Transport: Routing Vehicles and Scheduling Containers.

Degree: 2018, Delft University of Technology

In intermodal transport multiple types of vehicles are used to transport containers. If the routes of the vehicles are known, then the container allocation can… (more)

Subjects/Keywords: Branch and Bound; Cutting Plane; Multicommodity Flow; Intermodal Transport; Time-Space Graph; Network Design; Min Cost Flow; Column Generating; Local search algorithm; fix; fixed-charge; capacitated; Container; Barges; Reductions; ILP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kalicharan, K. (. (2018). Intermodal Transport: Routing Vehicles and Scheduling Containers. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12

Chicago Manual of Style (16th Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Masters Thesis, Delft University of Technology. Accessed November 26, 2020. http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

MLA Handbook (7th Edition):

Kalicharan, Kishan (author). “Intermodal Transport: Routing Vehicles and Scheduling Containers.” 2018. Web. 26 Nov 2020.

Vancouver:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Internet] [Masters thesis]. Delft University of Technology; 2018. [cited 2020 Nov 26]. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12.

Council of Science Editors:

Kalicharan K(. Intermodal Transport: Routing Vehicles and Scheduling Containers. [Masters Thesis]. Delft University of Technology; 2018. Available from: http://resolver.tudelft.nl/uuid:6a99a2a6-ae1d-4355-95db-363f8a399a12


University of Florida

5. Tadayon, Bita. Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems.

Degree: PhD, Industrial and Systems Engineering, 2014, University of Florida

 We address several optimization problems in which data elements are uncertain. For each problem we apply an appropriate method for uncertainty representation, propose efficient mathematical… (more)

Subjects/Keywords: Algorithms; Commodities; Hubs; Linear programming; Mathematical robustness; Mathematical sequences; Mink; Objective functions; Robust optimization; Scheduling; budgeted-uncertainty  – complexity-analysis  – congestion  – cutting-planes  – dynamic-programming  – integer-programming  – linearization  – multicommodity-flow  – network-optimization  – node-reliabilities  – robust-optimization  – scheduling  – single-machine  – uncertainty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tadayon, B. (2014). Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems. (Doctoral Dissertation). University of Florida. Retrieved from https://ufdc.ufl.edu/UFE0046568

Chicago Manual of Style (16th Edition):

Tadayon, Bita. “Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems.” 2014. Doctoral Dissertation, University of Florida. Accessed November 26, 2020. https://ufdc.ufl.edu/UFE0046568.

MLA Handbook (7th Edition):

Tadayon, Bita. “Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems.” 2014. Web. 26 Nov 2020.

Vancouver:

Tadayon B. Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems. [Internet] [Doctoral dissertation]. University of Florida; 2014. [cited 2020 Nov 26]. Available from: https://ufdc.ufl.edu/UFE0046568.

Council of Science Editors:

Tadayon B. Algorithms and Complexity Analysis for Integer Multicommodity Network Flow and Robust Single-Machine Scheduling Problems. [Doctoral Dissertation]. University of Florida; 2014. Available from: https://ufdc.ufl.edu/UFE0046568


University of Michigan

6. Chen, Richard Li-Yang. Models and Algorithms for Stochastic Network Design and Flow Problems: Applications in Truckload Procurement Auctions and Renewable Energy.

Degree: PhD, Industrial & Operations Engineering, 2010, University of Michigan

 This dissertation presents novel mathematical models and algorithms for stochastic network design and flow (SNDF) problems: the optimal design and flow of a network under… (more)

Subjects/Keywords: Network Design and Flow; Wind Farm Network Design; Combinatorial Auction; Two-stage Stochastic Multicommodity Flow Problem; Implicit Bidding Approach; Truckload Procurement; Business (General); Economics; Management; Industrial and Operations Engineering; Transportation; Business; Engineering

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chen, R. L. (2010). Models and Algorithms for Stochastic Network Design and Flow Problems: Applications in Truckload Procurement Auctions and Renewable Energy. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/76005

Chicago Manual of Style (16th Edition):

Chen, Richard Li-Yang. “Models and Algorithms for Stochastic Network Design and Flow Problems: Applications in Truckload Procurement Auctions and Renewable Energy.” 2010. Doctoral Dissertation, University of Michigan. Accessed November 26, 2020. http://hdl.handle.net/2027.42/76005.

MLA Handbook (7th Edition):

Chen, Richard Li-Yang. “Models and Algorithms for Stochastic Network Design and Flow Problems: Applications in Truckload Procurement Auctions and Renewable Energy.” 2010. Web. 26 Nov 2020.

Vancouver:

Chen RL. Models and Algorithms for Stochastic Network Design and Flow Problems: Applications in Truckload Procurement Auctions and Renewable Energy. [Internet] [Doctoral dissertation]. University of Michigan; 2010. [cited 2020 Nov 26]. Available from: http://hdl.handle.net/2027.42/76005.

Council of Science Editors:

Chen RL. Models and Algorithms for Stochastic Network Design and Flow Problems: Applications in Truckload Procurement Auctions and Renewable Energy. [Doctoral Dissertation]. University of Michigan; 2010. Available from: http://hdl.handle.net/2027.42/76005


Technical University of Lisbon

7. Moz, Margarida. Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar.

Degree: 2003, Technical University of Lisbon

Doutoramento em Matemática Aplicada à Economia e à Gestão

O objectivo desta dissertação é resolver um problema de escalonamento de pessoal em contexto hospitalar -… (more)

Subjects/Keywords: escalonamento de pessoal; reconstrução de escalas; programação linear inteira; fluxo inteiro multimercadorias; métodos heurísticos; algorítmos genéticos; personnel scheduling; rerostering; integer linear programming; integer multicommodity flow; heuristic; genetic algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Moz, M. (2003). Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar. (Thesis). Technical University of Lisbon. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/3617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Moz, Margarida. “Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar.” 2003. Thesis, Technical University of Lisbon. Accessed November 26, 2020. http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/3617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Moz, Margarida. “Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar.” 2003. Web. 26 Nov 2020.

Vancouver:

Moz M. Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar. [Internet] [Thesis]. Technical University of Lisbon; 2003. [cited 2020 Nov 26]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/3617.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Moz M. Técnicas de investigação operacional aplicadas a um problema de escalonamento de pessoal em contexto hospitalar. [Thesis]. Technical University of Lisbon; 2003. Available from: http://www.rcaap.pt/detail.jsp?id=oai:www.repository.utl.pt:10400.5/3617

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Λακουμέντας, Ιωάννης. Δρομολόγηση και ανάθεση συχνοτήτων σε WDM οπτικά δίκτυα.

Degree: 2006, University of Patras

Η δρομολόγηση και ανάθεση μηκών κύματος (routing and wavelength assignment - RWA) αποτελεί ένα πολύ σημαντικό πρόβλημα, που απασχολεί τους σχεδιαστές WDM οπτικών δικτύων και… (more)

Subjects/Keywords: Δρομολόγηση και ανάθεση μηκών κύματος; WDM οπτικά δίκτυα; Πρόβλημα ακέραιας ροής πολλαπλών πηγών-προορισμών; Γραμμικός προγραμματισμός; Περιορισμοί εξασθένησης; 621.381 31; Routing and wavelength assignment; WDM optical networks; Integer multicommodity flow problem; Linear programming; Impairment constraints

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

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

Chicago Manual of Style (16th Edition):

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

MLA Handbook (7th Edition):

Λακουμέντας, Ιωάννης. “Δρομολόγηση και ανάθεση συχνοτήτων σε WDM οπτικά δίκτυα.” 2006. Web. 26 Nov 2020.

Vancouver:

Λακουμέντας . Δρομολόγηση και ανάθεση συχνοτήτων σε WDM οπτικά δίκτυα. [Internet] [Masters thesis]. University of Patras; 2006. [cited 2020 Nov 26]. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/533.

Council of Science Editors:

Λακουμέντας . Δρομολόγηση και ανάθεση συχνοτήτων σε WDM οπτικά δίκτυα. [Masters Thesis]. University of Patras; 2006. Available from: http://nemertes.lis.upatras.gr/jspui/handle/10889/533


Pontifical Catholic University of Rio de Janeiro

9. ALEXANDRE ROCHA DUARTE. [en] NEW HEURISTICS AND AN INTEGER PROGRAMMING APPROACH TO AN INEXACT GRAPH MATCHING PROBLEM.

Degree: 2004, Pontifical Catholic University of Rio de Janeiro

[pt] Esta dissertação apresenta novos algoritmos aproximados e uma abordagem exata para a resolução de um problema de correspondência inexata de grafos. O problema considerado… (more)

Subjects/Keywords: [pt] PROGRAMACAO INTEIRA; [en] INTER LINEAR PROGRAMMIN; [pt] OTIMIZACAO COMBINATORIA; [en] COMBINATORIAL OPTIMIZATION; [pt] META-HEURISTICAS; [en] META-HEURISTICS; [pt] CORRESPONDENCIA INEXATA DE GRAFOS; [en] INEXACT GRAPH MATCHING; [pt] MODELAGEM POR MULTI-FLUXOS; [en] MULTICOMMODITY FLOW MODEL

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

DUARTE, A. R. (2004). [en] NEW HEURISTICS AND AN INTEGER PROGRAMMING APPROACH TO AN INEXACT GRAPH MATCHING PROBLEM. (Thesis). Pontifical Catholic University of Rio de Janeiro. Retrieved from http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

DUARTE, ALEXANDRE ROCHA. “[en] NEW HEURISTICS AND AN INTEGER PROGRAMMING APPROACH TO AN INEXACT GRAPH MATCHING PROBLEM.” 2004. Thesis, Pontifical Catholic University of Rio de Janeiro. Accessed November 26, 2020. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

DUARTE, ALEXANDRE ROCHA. “[en] NEW HEURISTICS AND AN INTEGER PROGRAMMING APPROACH TO AN INEXACT GRAPH MATCHING PROBLEM.” 2004. Web. 26 Nov 2020.

Vancouver:

DUARTE AR. [en] NEW HEURISTICS AND AN INTEGER PROGRAMMING APPROACH TO AN INEXACT GRAPH MATCHING PROBLEM. [Internet] [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2004. [cited 2020 Nov 26]. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4715.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

DUARTE AR. [en] NEW HEURISTICS AND AN INTEGER PROGRAMMING APPROACH TO AN INEXACT GRAPH MATCHING PROBLEM. [Thesis]. Pontifical Catholic University of Rio de Janeiro; 2004. Available from: http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=4715

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

10. Emanuelsson, Kristoffer. Approximating multi-commodity max-flow in practice.

Degree: Computer Science and Communication (CSC), 2016, KTH

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… (more)

Subjects/Keywords: multi-commodity; maximum flow; max flow; flow; multicommodity; approximation; schemes; framework; dynamic graph; dynamic; ES-tree; complexity; space; time; Madry; multicommodity; maximum flöde; max flöde; flöde; approximering; framework; dynamiska grafer; graf; dynamiskgraf; ES-träd; tidskomplexitet; komplexitet; minneskomplexitet; Madry; Computer Sciences; Datavetenskap (datalogi)

…algorithm may be able to solve the multicommodity maximum flow faster than any other algorithm… …29 3.4 Implementing the maximum flow algorithm . . . . . . . . . . . . . . 29 3.5… …algorithm for calculation the multi-commodity maximum flow 13 2 Implementation of the… …of the improved multi-commodity maximum flow algorithm… …10 77 Implementation of FindAdmissiblePair for the improved multi-commodity max-flow… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Emanuelsson, K. (2016). Approximating multi-commodity max-flow in practice. (Thesis). KTH. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Emanuelsson, Kristoffer. “Approximating multi-commodity max-flow in practice.” 2016. Thesis, KTH. Accessed November 26, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Emanuelsson, Kristoffer. “Approximating multi-commodity max-flow in practice.” 2016. Web. 26 Nov 2020.

Vancouver:

Emanuelsson K. Approximating multi-commodity max-flow in practice. [Internet] [Thesis]. KTH; 2016. [cited 2020 Nov 26]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Emanuelsson K. Approximating multi-commodity max-flow in practice. [Thesis]. KTH; 2016. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-184193

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

.