• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 6740
  • 2450
  • 1001
  • 805
  • 775
  • 234
  • 168
  • 118
  • 82
  • 79
  • 70
  • 63
  • 54
  • 50
  • 47
  • Tagged with
  • 14938
  • 2411
  • 1971
  • 1813
  • 1634
  • 1526
  • 1368
  • 1320
  • 1276
  • 1249
  • 1216
  • 1109
  • 970
  • 923
  • 920
  • 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.
201

An advanced tabu search approach to the airlift loading problem

Roesener, August G. 28 August 2008 (has links)
Not available / text
202

Network routing problems in stochastic-state networks

Fajardo, David Ignacio 15 June 2011 (has links)
Network Routing problems focus on exploiting the network-based struc- ture of a mathematical optimization problem to establish e cient solutions that are tailored to the problem at hand. The topic of this dissertation relates to a speci c class of network routing problems, those in which the properties of the nodes and/or links in the network can be represented as instances of a particular network-state realization, where the set possible network-state can be represented by a discrete probability distribution. The main contribution of this research is to formalize the de nition of such families of network-states, a construct we de ne as Stochastic-State Networks (SSN), and show that certain properties of such networks can allow for the systematic development of exact and heuristic solution procedures for a speciric class of network routing problems. The class of network problems considered are those in which dynamic routing decisions are seeked, and where information about the network can only be gathered through direct observation of the instantiation of the stochastic elements of the network. Two speci c instances of routing problems are considered: a dynamic instance of a Traveling Salesman Problem, and a routing problem in the presence of stochastic link failures. Exact methods and heuristics are developed by exploiting the underlaying stochastic-state network formulation and numerical results are presented. / text
203

Nonlinear time-delay optimal control problem: optimality conditions and duality

李澤康, Lee, Chak-hong. January 1995 (has links)
published_or_final_version / Mathematics / Master / Master of Philosophy
204

OPTIMIZATION STUDIES IN NUCLEAR ENGINEERING

Rosztoczy, Z. R. (Zoltan R.) January 1964 (has links)
No description available.
205

OPTIMAL TRAJECTORIES WITH STATE VARIABLE AND CONTROL VARIABLE INEQUALITY CONSTRAINTS

Lutze, Frederick Henry, 1937- January 1967 (has links)
No description available.
206

TRANSFORMATIONS AND DISCONTINUITIES FOR OPTIMAL SPACE TRAJECTORIES

Mason, Joseph D. January 1968 (has links)
No description available.
207

HYBRID COMPUTER METHODS FOR DIRECT FUNCTIONAL OPTIMIZATION

Andrews, Michael, 1940- January 1972 (has links)
No description available.
208

A comparison of some computational techniques for the solution of optimal control problems

Murray, Suzanne Elanore Turner, 1940- January 1965 (has links)
No description available.
209

Optimization in control and estimation problems using fixed configuration

Sims, Craig Stephen January 1967 (has links)
No description available.
210

Pontryagin's maximum principle

Wozny, M. J. (Michael J.) January 1962 (has links)
No description available.

Page generated in 0.0579 seconds