• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 418
  • 300
  • 59
  • 50
  • 24
  • 12
  • 10
  • 10
  • 9
  • 7
  • 6
  • 6
  • 6
  • 6
  • 6
  • Tagged with
  • 1075
  • 1075
  • 323
  • 275
  • 266
  • 168
  • 127
  • 116
  • 104
  • 104
  • 100
  • 91
  • 81
  • 80
  • 77
  • 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

An implicit enumeration algorithm for integer programming

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

Maximal funnel-node flows in an undirected network

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

Development of controlled computational experiments on integer linear programming procedures

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

A technique for finding the center of a polytope

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

Design and scheduling of chemical bath processing lines

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

An investigation of an exterior point method for linear programming

Pudwill, Rodger A. 12 1900 (has links)
No description available.
27

The development of mathematical models to describe seat allocation in stadia

Hughey, Walter Lee 05 1900 (has links)
No description available.
28

Affine scaling algorithms for linear programs and linearly constrained convex and concave programs

Wang, Yanhui 05 1900 (has links)
No description available.
29

An algorithm for maximal flow with gains in a special network

Jezior, Anthony Michael 12 1900 (has links)
No description available.
30

Some properties of the affine scaling algorithm

Castillo, Ileana 05 1900 (has links)
No description available.

Page generated in 0.1113 seconds