• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 403
  • 315
  • 50
  • 46
  • 24
  • 12
  • 10
  • 10
  • 9
  • 8
  • 7
  • 6
  • 5
  • 4
  • 4
  • Tagged with
  • 1042
  • 1042
  • 339
  • 279
  • 278
  • 186
  • 129
  • 114
  • 106
  • 100
  • 94
  • 94
  • 83
  • 80
  • 80
  • 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

Fractional domination, fractional packings, and fractional isomorphisms of graphs

Rubalcaba, Roberto Ramon, Johnson, Peter D. January 2005 (has links) (PDF)
Dissertation (Ph.D.)--Auburn University, 2005. / Abstract. Vita. Includes bibliographic references (p.104-114).
22

A cascade approach for staircase linear programs with an application to Air Force mobility optimization /

Baker, Steven F. January 1997 (has links) (PDF)
Dissertation (Ph.D. in Operations Research) Naval Postgraduate School, June 1997. / Dissertation supervisor, Richard E. Rosenthal. Includes bibliographical references (p. 139-141). Also available online.
23

A SAT-based planning framework for optimizing resource production /

Ventura, Christopher. January 1900 (has links)
Thesis (M.S.)--Oregon State University, 2008. / Printout. Includes bibliographical references (leaves 54-56). Also available on the World Wide Web.
24

Methods for the numerical solution of the eigenvalue problem for real symetric matrices

Yamamura, Eddie Akira January 1962 (has links)
The purpose of this thesis is to give a survey of the methods currently used to solve the numerical eigenvalue problem for real symmetric matrices. On the basis of the advantages and disadvantages inherent in the various methods, it is concluded that Householder's method is the best. Since the methods of Givens, Lanczos, and Householder use the Sturm sequence bisection algorithm as the final stage, a complete theoretical discussion of this process is included. Error bounds from a floating point error analysis (due to Ortega), for the Householder reduction are given. In addition, there is a complete error analysis for the bisection process. / Science, Faculty of / Mathematics, Department of / Graduate
25

The linear programming problem /

Dessouky, Mohamed Ibrahim January 1956 (has links)
No description available.
26

Algorithms for the hand-computation solution of the transhipment problem and maximum flow in a restricted network /

Brown, Edward A. January 1959 (has links)
No description available.
27

On a special class of problems in integer linear programming /

Nelson, Larry Dean January 1965 (has links)
No description available.
28

Utilization of a priori information in the statistical interpretation of measured distribution /

Burrus, Walter Ross January 1964 (has links)
No description available.
29

Computer Solution of Linear Programming Problems Using the Decomposition Algorithm

Kraslawsky, Walter Paul 01 January 1973 (has links) (PDF)
No description available.
30

The analytic center cutting plane method with semidefinite cuts /

Oskoorouchi, Mohammad R. January 2002 (has links)
No description available.

Page generated in 0.0961 seconds