Spelling suggestions: "subject:"amathematical optimization."" "subject:"dmathematical optimization.""
31 |
Benchmark generation in a new framework /Li, Xi. January 2007 (has links)
Thesis (Ph.D.)--Hong Kong University of Science and Technology, 2007. / Includes bibliographical references (leaves 85-90). Also available in electronic version.
|
32 |
Global optimization of chemical process networks for resource recovery and power generationMartin, Lealon LeCorte. January 2002 (has links) (PDF)
Thesis (Ph.D.)--University of California, Los Angeles, 2002. / Chair: Vasilios I. Manousiouthakis. Includes bibliographical references.
|
33 |
Join-order optimization with Cartesian productsVance, Bennet 01 1900 (has links) (PDF)
Ph.D. / Computer Science and Engineering / Join-order optimization plays a central role in the processing of relational database queries. This dissertation presents two new algorithms for join-order optimization: a deterministic, exhaustive-search algorithm, and a stochastic algorithm that is based on the deterministic one. The deterministic algorithm achieves new complexity bounds for exhaustive search in join-order optimization; and in timing tests, both algorithms are shown to run many times faster than their predecessors. In addition, these new, fast algorithms search a larger space of join orders than is customary in join-order optimization. Not only do they consider all the so-called bushy join orders, rather than just the left-deep ones, but-what is more unusual-they also consider all join orders that contain Cartesian products. The novel construction of these algorithms enables them to search a space including Cartesian products without paying the performance penalty that is conventionally associated with such a search.
|
34 |
Dynamic process optimization through adjoint formulations and constraint aggregation /Bloss, Karl F., January 2000 (has links)
Thesis (Ph. D.)--Lehigh University, 2000. / Includes vita. Includes bibliographical references (leaves 108-114).
|
35 |
New algorithms for Quadratic Unconstrained Binary Optimization (QUBO) with applications in engineering and social sciencesTavares, Gabriel. January 2008 (has links)
Thesis (Ph. D.)--Rutgers University, 2008. / "Graduate Program in Operations Research." Includes bibliographical references (p. 419-435).
|
36 |
Software engineering of a direct search package for nonlinear optimization /Liarakos, Michael. January 2009 (has links)
Thesis (Honors)--College of William and Mary, 2009. / Includes bibliographical references (leaf 37). Also available via the World Wide Web.
|
37 |
An adaptive tabu search approach to cutting and packing problemsHarwig, John Michael, Barnes, J. Wesley, January 2003 (has links) (PDF)
Thesis (Ph. D.)--University of Texas at Austin, 2003. / Supervisor: J. Wesley Barnes. Vita. Includes bibliographical references. Available also from UMI Company.
|
38 |
Batch scheduling of two-machine limited-buffer flowshop with setup and removal timesDai, Jianbin, January 2003 (has links) (PDF)
Thesis (Ph. D.)--School of Industrial and Systems Engineering, Georgia Institute of Technology, 2004. Directed by Chen Zhou. / Vita. Includes bibliographical references (leaves 87-90).
|
39 |
Algorithms for budgeted auctions and multi-agent covering problemsGoel, Gagan. January 2009 (has links)
Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010. / Committee Chair: Vazirani, Vijay; Committee Member: Kalai, Adam; Committee Member: Mihail, Milena; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin. Part of the SMARTech Electronic Thesis and Dissertation Collection.
|
40 |
Fixed point methods for loss networks /Thompson, Mark Richard. January 2002 (has links) (PDF)
Thesis (Ph. D.)--University of Queensland, 2002. / Includes bibliographical references.
|
Page generated in 0.1503 seconds