Log in

Relevant bibliographies by topics / Mathematical optimization. Algorithms. Network analysis (Planning) / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Mathematical optimization. Algorithms. Network analysis (Planning).

Dissertations / Theses on the topic 'Mathematical optimization. Algorithms. Network analysis (Planning)'

Author: Grafiati

Published: 4 June 2021

Last updated: 16 February 2022

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

Select a source type:

Consult the top 21 dissertations / theses for your research on the topic 'Mathematical optimization. Algorithms. Network analysis (Planning).'

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

Hojnacki, Susan M. "Optimizing algorithms for shortest path analysis /." Online version of thesis, 1991. http://hdl.handle.net/1850/11143.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Brayman, Vladimir. "Hierarchical distributed algorithm for optimization of flows and prices in logistics distribution networks /." Thesis, Connect to this title online; UW restricted, 2003. http://hdl.handle.net/1773/5876.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Yim, Ka-wing, and 嚴家榮. "A reliability-based land use and transportation optimization model." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2005. http://hub.hku.hk/bib/B34618879.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Wang, Shentao. "Supply chain planning using network flow optimization." online access from Digital Dissertation Consortium access full-text, 2003. http://libweb.cityu.edu.hk/cgi-bin/er/db/ddcdiss.pl?MQ89164.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Siomina, Iana. "Radio Network Planning and Resource Optimization : Mathematical Models and Algorithms for UMTS, WLANs, and Ad Hoc Networks." Doctoral thesis, Norrköping : Department of Science and Technology, Linköping University, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-9158.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

He, Qie. "Topics in discrete optimization: models, complexity and algorithms." Diss., Georgia Institute of Technology, 2013. http://hdl.handle.net/1853/50237.

Full text

Abstract:

In this dissertation we examine several discrete optimization problems through the perspectives of modeling, complexity and algorithms. We first provide a probabilistic comparison of split and type 1 triangle cuts for mixed-integer programs with two rows and two integer variables in terms of cut coefficients and volume cutoff. Under a specific probabilistic model of the problem parameters, we show that for the above measure, the probability that a split cut is better than a type 1 triangle cut is higher than the probability that a type 1 triangle cut is better than a split cut. The analysis al

APA, Harvard, Vancouver, ISO, and other styles

7

Haiba, Mohamed Salem. "A study and implementation of the network flow problem and edge integrity of networks." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/834644.

Full text

Abstract:

Fundamental problems in graph theory are of four types existence, construction, enumeration and optimization problems. Optimization problems lie at the interface between computer science and the field of operations research and are of primary importance in decision-making. In this thesis, two optimization problems are studied: the edge-integrity of networks and the network flow problem. An implementation of the corresponding algorithms is also realized.The edge integrity of a communication network provides a way to assess the vulnerability of the network to disruption through the destruction o

APA, Harvard, Vancouver, ISO, and other styles

8

Guan, Junfei. "Simultaneous optimization of transit line configuration and passenger line assignment /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?CIVL%202004%20GUAN.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Boginski, Vladimir L. "Optimization and information retrieval techniques for complex networks." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0011379.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Yim, Ka-wing. "A reliability-based land use and transportation optimization model." Click to view the E-thesis via HKUTO, 2005. http://sunzi.lib.hku.hk/hkuto/record/B34618879.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Wong, Chi-Fai. "CACAO : client-assisted channel assignment optimization for uncoordinated home WLANs /." View abstract or full-text, 2007. http://library.ust.hk/cgi/db/thesis.pl?CSED%202007%20WONG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Malmgren, Henrik. "Revision of an artificial neural network enabling industrial sorting." Thesis, Uppsala universitet, Institutionen för teknikvetenskaper, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-392690.

Full text

Abstract:

Convolutional artificial neural networks can be applied for image-based object classification to inform automated actions, such as handling of objects on a production line. The present thesis describes theoretical background for creating a classifier and explores the effects of introducing a set of relatively recent techniques to an existing ensemble of classifiers in use for an industrial sorting system.The findings indicate that it's important to use spatial variety dropout regularization for high resolution image inputs, and use an optimizer configuration with good convergence properties. T

APA, Harvard, Vancouver, ISO, and other styles

13

Fan, Wei 1974. "Optimal transit route network design problem : algorithms, implementations, and numerical results." 2004. http://hdl.handle.net/2152/12769.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Fan, Wei Machemehl Randy B. "Optimal transit route network design problem algorithms, implementations, and numerical results /." 2004. http://wwwlib.umi.com/cr/utexas/fullcit?p3143741.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Marcon, Alister Justin. "Flows in networks : an algorithmic approach." Thesis, 2013. http://hdl.handle.net/10210/8364.

Full text

Abstract:

M.Sc. (Mathematics)<br>In Chapter 1, we consider the relevant theory pertaining to graphs and digraphs that will be used in the study of flows in networks. Warshall’s algorithm for reachability is also considered since it will allow us to ascertain whether some paths exist in some instance. In Chapter 2, we explore flows and cuts in networks. We define the basic concepts of source, sink, intermediate vertices, capacity, costs and lower-bounds. Feasible flows are defined, as well as the value of a flow. Cuts in capacitated networks are explored and further theory relating the value of a flow an

APA, Harvard, Vancouver, ISO, and other styles

16

Singh, Vidya Bhushan. "User Modeling and Optimization for Environmental Planning System Design." Thesis, 2014. http://hdl.handle.net/1805/6114.

Full text

Abstract:

Indiana University-Purdue University Indianapolis (IUPUI)<br>Environmental planning is very cumbersome work for environmentalists, government agencies like USDA and NRCS, and farmers. There are a number of conflicts and issues involved in such a decision making process. This research is based on the work to provide a common platform for environmental planning called WRESTORE (Watershed Restoration using Spatio-Temporal Optimization of Resources). We have designed a system that can be used to provide the best management practices for environmental planning. A distributed system was designed to

APA, Harvard, Vancouver, ISO, and other styles

17

"Time-varying network optimization problems." 1999. http://library.cuhk.edu.hk/record=b6073189.

Full text

Abstract:

Dan Sha.<br>Thesis (Ph.D.)--Chinese University of Hong Kong, 1999.<br>Includes bibliographical references (p. 193-206).<br>Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web.<br>Mode of access: World Wide Web.<br>Abstracts in English and Chinese.

APA, Harvard, Vancouver, ISO, and other styles

18

Pan, Feng. "Stochastic network interdiction models and methods /." Thesis, 2005. http://repositories.lib.utexas.edu/bitstream/handle/2152/1692/panf72229.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

He, Ran. "A Graphon-based Framework for Modeling Large Networks." Thesis, 2015. https://doi.org/10.7916/D8MC8Z3C.

Full text

Abstract:

This thesis focuses on a new graphon-based approach for fitting models to large networks and establishes a general framework for incorporating nodal attributes to modeling. The scale of network data nowadays, renders classical network modeling and inference inappropriate. Novel modeling strategies are required as well as estimation methods. Depending on whether the model structure is specified a priori or solely determined from data, existing models for networks can be classified as parametric and non-parametric. Compared to the former, a non-parametric model often allows for an easier a

APA, Harvard, Vancouver, ISO, and other styles

20

Παχουνδάκης, Παντελής. "Μοντέλα βελτιστοποίησης δικτύων". Thesis, 2002. http://nemertes.lis.upatras.gr/jspui/handle/10889/3584.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Hochmuth, Christian Andreas. "Strategische Planung technischer Kapazität in komplexen Produktionssystemen: mathematische Optimierung grafischer Modelle mit der Software AURELIE." 2019. https://monarch.qucosa.de/id/qucosa%3A70843.

Full text

Abstract:

Aktuelle Entwicklungen führen zu komplexeren Produktionssystemen, insbesondere in der variantenreichen Serienfertigung. Als Folge bestehen erhebliche Herausforderungen darin, die technische Kapazität mit strategischem Zeithorizont effizient, transparent und flexibel zu planen. Da zahlreiche Abhängigkeiten berücksichtigt werden müssen, ist in der Praxis festzustellen, dass sich Vollständigkeit und Verständlichkeit der Modelle ausschließen. Zur Lösung dieses Zielkonflikts wird ein softwaregestützter Workflow vorgeschlagen, welcher in der neu entwickelten Software AURELIE realisiert wurde. Der Wo

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!