• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 16
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • Tagged with
  • 30
  • 30
  • 30
  • 7
  • 6
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • 3
  • 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.
11

Computational investigation of cutting techniques for integer programming /

Puttapanom, Sutanit. January 2003 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 110-113). Also available on the Internet.
12

Computational investigation of cutting techniques for integer programming

Puttapanom, Sutanit. January 2003 (has links)
Thesis (M.S.)--University of Missouri-Columbia, 2003. / Typescript. Includes bibliographical references (leaves 110-113). Also available on the Internet.
13

Progressive disaggregation for fixed charge network flow problems

Adaniya, Oscar 05 1900 (has links)
No description available.
14

A method for solving the minimization of the maximum number of open stacks problem within a cutting process

Poliquit, Elmer S. January 2008 (has links) (PDF)
Thesis (M.S.)--University of North Carolina Wilmington, 2008. / Title from PDF title page (viewed September 24, 2008) Includes bibliographical references (p. 46-47)
15

Genepart algorithm, clustering and feature selection for DNA micro-array data

Zhang, Weihua. January 2004 (has links) (PDF)
Thesis (M.S.)--Montana State University--Bozeman, 2004. / Typescript. Chairperson, Graduate Committee: Brendan Mumey. Includes bibliographical references (leaves 45-47).
16

The column subtraction method for the traveling salesman problem.

Wolff, Friedel 13 June 2008 (has links)
Smith, T.H.C., Prof.
17

FIXED ORDER BRANCH AND BOUND METHODS FOR MIXED-INTEGER PROGRAMMING.

SINGHAL, JAYA ASTHANA. January 1982 (has links)
The aim of this dissertation is to present an algorithm for mixed integer programs which when started with a good heuristic solution can find improved solutions and reduce the error estimate as quickly as possible. This is achieved by using two ideas: a fixed order branch-and-bound method with selective expansion of subproblems and the sieve strategy which uses stronger than optimal bounds. The fixed order branch-and-bound method with selective expansion of subproblems is effective in reducing the error estimate quickly whereas the sieve strategy is effective in reducing the error estimate as well as finding improved solutions quickly. Computational experience is reported.
18

Optimizing Safety Stock Placement in General Network Supply Chains

Graves, Stephen C., Lesnaia, Ekaterina 01 1900 (has links)
In the paper, we minimize the holding cost of the safety stock held in a supply chain modeled as a general network. By our assumption, the demand is bounded by a concave function. This fact allows us to formulate the problem as a deterministic optimization. We minimize a concave function over a discrete polyhedron. The main goal of the paper is to describe an algorithm to solve the problem without assuming any particular structure of the underlying supply chain. The algorithm is a branch and bound algorithm. / Singapore-MIT Alliance (SMA)
19

Heuristic scheduling procedures to achieve workload balance on parallel processors

White, Emett Robert 12 1900 (has links)
No description available.
20

Arc-path approaches to fixed charge network problems

Choe, Ui Chong 12 1900 (has links)
No description available.

Page generated in 0.363 seconds