- 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 11 to 20 of 1033 (0.089 seconds)Spelling suggestions: "subject:"anonlinear erogramming"" "subject:"anonlinear grogramming""
| 11 |
Extracting Surface Structural Information from Vibrational Spectra with Linear ProgrammingHung, Kuo Kai 21 August 2015 (has links)
Vibrational spectra techniques such as IR, Raman and SFG all carry molecular orientation
information. Extracting the orientation information from the vibrational spectra often
involves creating model spectra with known orientation details to match the experimental
spectra. The running time for the exhaustive approach is O(n!). With the help of linear
programming, the running time is pseudo O(n). The linear programming approach is
with out a doubt far more superior than exhaustive approach in terms of running time.
We verify the accuracy of the answer of the linear programming approach by creating
mock experimental data with known molecular orientation distribution information of
alanine, isoleucine, methionine, lysine, valine and threonine. Linear programming returns
the correct orientation distribution information when the mock experimental spectrum
consisted of different amino acids. As soon as the mock experimental spectrum consisted
of same amino acids, different conformer with different orientation distribution, linear
programming fails to give the correct answer albeit the species population is roughly
correct. / Graduate
|
| 12 |
An implicit enumeration algorithm for integer programmingTrotter, Leslie Earl 12 1900 (has links)
No description available.
|
| 13 |
Development of controlled computational experiments on integer linear programming proceduresLin, Benjamin Wei-Yuh 12 1900 (has links)
No description available.
|
| 14 |
A technique for finding the center of a polytopeMoretti, Antonio Carlos 12 1900 (has links)
No description available.
|
| 15 |
An algorithm for maximal flow with gains in a special networkJezior, Anthony Michael 12 1900 (has links)
No description available.
|
| 16 |
Toeplitz matrices and interior point methods for linear programmingCastillo, Ileana 05 1900 (has links)
No description available.
|
| 17 |
A linear programming model for the analysis of traffic in a highway networkHeanue, Kevin Edward 12 1900 (has links)
No description available.
|
| 18 |
Multiple Choice Integer Programming with few constraintsKayal, N. M. W. January 1984 (has links)
No description available.
|
| 19 |
Model generation and sampling algorithms for dynamic stochastic programmingPoire, Xavier Corvera January 1996 (has links)
No description available.
|
| 20 |
Open Vehicle Routing Problem : description, formulations and heuristic methodsSariklis, Dimitrios January 1997 (has links)
No description available.
|
Page generated in 0.1112 seconds