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:(congestion problems). Showing records 1 – 4 of 4 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


King Abdullah University of Science and Technology

1. Evangelista, David. Stationary Mean-Field Games with Congestion.

Degree: Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division, 2019, King Abdullah University of Science and Technology

 Mean-field games (MFG) are models of large populations of rational agents who seek to optimize an objective function that takes into account their state variables… (more)

Subjects/Keywords: mean-field games; congestion problems; stationary problems; calculus f variations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Evangelista, D. (2019). Stationary Mean-Field Games with Congestion. (Thesis). King Abdullah University of Science and Technology. Retrieved from http://hdl.handle.net/10754/655679

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):

Evangelista, David. “Stationary Mean-Field Games with Congestion.” 2019. Thesis, King Abdullah University of Science and Technology. Accessed April 10, 2021. http://hdl.handle.net/10754/655679.

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

MLA Handbook (7th Edition):

Evangelista, David. “Stationary Mean-Field Games with Congestion.” 2019. Web. 10 Apr 2021.

Vancouver:

Evangelista D. Stationary Mean-Field Games with Congestion. [Internet] [Thesis]. King Abdullah University of Science and Technology; 2019. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/10754/655679.

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

Council of Science Editors:

Evangelista D. Stationary Mean-Field Games with Congestion. [Thesis]. King Abdullah University of Science and Technology; 2019. Available from: http://hdl.handle.net/10754/655679

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


University of Oxford

2. Law, Hiu-Fai. Trees and graphs : congestion, polynomials and reconstruction.

Degree: PhD, 2011, University of Oxford

 Spanning tree congestion was defined by Ostrovskii (2004) as a measure of how well a network can perform if only minimal connection can be maintained.… (more)

Subjects/Keywords: 511.52; Combinatorics; spanning tree congestion; random graphs; regularity lemma; inverse problems; reconstruction; partition function

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Law, H. (2011). Trees and graphs : congestion, polynomials and reconstruction. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206

Chicago Manual of Style (16th Edition):

Law, Hiu-Fai. “Trees and graphs : congestion, polynomials and reconstruction.” 2011. Doctoral Dissertation, University of Oxford. Accessed April 10, 2021. http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206.

MLA Handbook (7th Edition):

Law, Hiu-Fai. “Trees and graphs : congestion, polynomials and reconstruction.” 2011. Web. 10 Apr 2021.

Vancouver:

Law H. Trees and graphs : congestion, polynomials and reconstruction. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2021 Apr 10]. Available from: http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206.

Council of Science Editors:

Law H. Trees and graphs : congestion, polynomials and reconstruction. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:54190b51-cd9d-489e-a79e-82ecdf15b4c5 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.558206


University of Rochester

3. Jaramillo Vidales, Paula (1977 - ). Essays in matching and cost sharing problems.

Degree: PhD, 2010, University of Rochester

 This thesis is a collection of essays on matching and cost sharing problems. In chapter 1, we study decentralized matching processes in which agents make… (more)

Subjects/Keywords: Matching; Preference updating; Strategy-proofness; Indivisible goods; Cost sharing; Airport problems; Congestion

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jaramillo Vidales, P. (. -. ). (2010). Essays in matching and cost sharing problems. (Doctoral Dissertation). University of Rochester. Retrieved from http://hdl.handle.net/1802/12739

Chicago Manual of Style (16th Edition):

Jaramillo Vidales, Paula (1977 - ). “Essays in matching and cost sharing problems.” 2010. Doctoral Dissertation, University of Rochester. Accessed April 10, 2021. http://hdl.handle.net/1802/12739.

MLA Handbook (7th Edition):

Jaramillo Vidales, Paula (1977 - ). “Essays in matching and cost sharing problems.” 2010. Web. 10 Apr 2021.

Vancouver:

Jaramillo Vidales P(-). Essays in matching and cost sharing problems. [Internet] [Doctoral dissertation]. University of Rochester; 2010. [cited 2021 Apr 10]. Available from: http://hdl.handle.net/1802/12739.

Council of Science Editors:

Jaramillo Vidales P(-). Essays in matching and cost sharing problems. [Doctoral Dissertation]. University of Rochester; 2010. Available from: http://hdl.handle.net/1802/12739


Delft University of Technology

4. Stegers, E.M. (author). A Solution Method for Vehicle Routing Problems with Time-Dependent Travel Times.

Degree: 2009, Delft University of Technology

The goal of this thesis is developing an efficient method that produces good quality solutions to real-life Vehicle Routing Problems with time-dependent travel times. The… (more)

Subjects/Keywords: Vehicle Routing Problems; time dependent travel time and speed; congestion; heuristic methods; transportation; logistics cost

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Stegers, E. M. (. (2009). A Solution Method for Vehicle Routing Problems with Time-Dependent Travel Times. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:2329a49e-f80e-4340-ae2c-c64883e82999

Chicago Manual of Style (16th Edition):

Stegers, E M (author). “A Solution Method for Vehicle Routing Problems with Time-Dependent Travel Times.” 2009. Masters Thesis, Delft University of Technology. Accessed April 10, 2021. http://resolver.tudelft.nl/uuid:2329a49e-f80e-4340-ae2c-c64883e82999.

MLA Handbook (7th Edition):

Stegers, E M (author). “A Solution Method for Vehicle Routing Problems with Time-Dependent Travel Times.” 2009. Web. 10 Apr 2021.

Vancouver:

Stegers EM(. A Solution Method for Vehicle Routing Problems with Time-Dependent Travel Times. [Internet] [Masters thesis]. Delft University of Technology; 2009. [cited 2021 Apr 10]. Available from: http://resolver.tudelft.nl/uuid:2329a49e-f80e-4340-ae2c-c64883e82999.

Council of Science Editors:

Stegers EM(. A Solution Method for Vehicle Routing Problems with Time-Dependent Travel Times. [Masters Thesis]. Delft University of Technology; 2009. Available from: http://resolver.tudelft.nl/uuid:2329a49e-f80e-4340-ae2c-c64883e82999

.