• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 442
  • 315
  • 59
  • 50
  • 24
  • 12
  • 10
  • 10
  • 9
  • 9
  • 7
  • 7
  • 6
  • 6
  • 6
  • Tagged with
  • 1121
  • 1121
  • 342
  • 288
  • 279
  • 184
  • 134
  • 119
  • 108
  • 107
  • 106
  • 97
  • 83
  • 82
  • 82
  • 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.
21

A general linear programming model of the manufacturing firm /

Moore, William Shepherd, January 1971 (has links)
Thesis (Ph. D.)--Ohio State University, 1971. / Includes vita. Includes bibliographical references (leaves 223-227). Available online via OhioLINK's ETD Center.
22

Efficient supernodal sparse Cholesky factorization

Mascarenhas, Adrian. January 2002 (has links)
Thesis (M.S.)--University of Florida, 2002. / Title from title page of source document. Document formatted into pages; contains xi, 84 p.; also contains graphics. Includes vita. Includes bibliographical references.
23

Extracting Surface Structural Information from Vibrational Spectra with Linear Programming

Hung, 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
24

A solution to optimization problems with discontinuities

McLennan, Clyde Jack, 1939- January 1967 (has links)
No description available.
25

The specification and synthesis of high-order control systems

Dial, Joseph Hubbard, 1939- January 1968 (has links)
No description available.
26

An implicit enumeration algorithm for integer programming

Trotter, Leslie Earl 12 1900 (has links)
No description available.
27

Maximal funnel-node flows in an undirected network

Miller, Duane David 08 1900 (has links)
No description available.
28

Development of controlled computational experiments on integer linear programming procedures

Lin, Benjamin Wei-Yuh 12 1900 (has links)
No description available.
29

A technique for finding the center of a polytope

Moretti, Antonio Carlos 12 1900 (has links)
No description available.
30

Design and scheduling of chemical bath processing lines

Li, Jun-Sheng 08 1900 (has links)
No description available.

Page generated in 0.0777 seconds