- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 181 to 190 of 1198 (0.27 seconds)Spelling suggestions: "subject:"amathematical optimization"" "subject:"dmathematical optimization""
| 181 |
Optimal quantities for hospital supply groupingsBramblett, Richard Massey 12 1900 (has links)
No description available.
|
| 182 |
Topics in airline crew scheduling and large scale optimizationKlabjan, Diego 08 1900 (has links)
No description available.
|
| 183 |
Dynamic control of a tidal hydro-electric plantKerr, Wayne R. January 1974 (has links)
No description available.
|
| 184 |
Recursive descent optimization of structured loopsRoss, Keenan Olin January 1984 (has links)
No description available.
|
| 185 |
A general approach to the planning of a transmission networkMeliopoulos, A. P. Sakis 08 1900 (has links)
No description available.
|
| 186 |
Intelligent modeling for control, reconfiguration and optimization of discrete event systemsMahmood, Waqar 08 1900 (has links)
No description available.
|
| 187 |
Auto-tuning control using optimization techniquesKnueven, Susan 08 1900 (has links)
No description available.
|
| 188 |
A study and implementation of the network flow problem and edge integrity of networksHaiba, Mohamed Salem January 1991 (has links)
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 or failure of some of its links. While the computation of the edge-integrity of graphs in general has been proven to be NPcomplete, a recently published paper was devoted to a good algorithm using a technique of edge separation sequence for computing the edge integrity of trees. The main results of this paper will be presented and an implementation of this algorithm is achieved.The network flow problem models a distribution system in which commodities are flowing through an interconnected network. The goal is to find a maximum feasible flow and its value, given the capacity constraints for each edge. The three majors algorithms for this problem (Ford -Fulkerso n, Edmonds-Karp method, MPKM algorithm) are discussed, their complexities compared and an implementation of the Ford-Fulkerson and the MPKM algorithms is presented. / Department of Computer Science
|
| 189 |
Batch scheduling of two-machine limited-buffer flowshop with setup and removal timesDai, Jianbin 01 December 2003 (has links)
No description available.
|
| 190 |
Computer aided optimization of non-equally spaced linear arrays.Lau, Honkan January 1971 (has links)
No description available.
|
Page generated in 0.4812 seconds