• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 253
  • 131
  • 58
  • 17
  • 12
  • 9
  • 4
  • 4
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 2
  • Tagged with
  • 652
  • 652
  • 220
  • 201
  • 124
  • 112
  • 97
  • 95
  • 92
  • 77
  • 71
  • 64
  • 64
  • 64
  • 62
  • 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.

Computational improvements to Benders decomposition for generalized fixed charge problems /

Battilega, John Anthony. January 1973 (has links)
Thesis (Ph. D.)--Oregon State University, 1973. / Typescript (photocopy). Includes bibliographical references. Also available on the World Wide Web.

An integer programming model for Navy's Maritime Patrol Aviation fleet

Drash, Robert W. January 1990 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, September 1990. / Thesis Advisor(s): Wood, R. Kevin. Second Reader: Rosenthal, Richard E. "September 1990." Description based on title screen as viewed on December 17, 2009. Author(s) subject terms: Optimization, P-3, modernization, integer programming. Includes bibliographical references (p. 69). Also available in print.

Group theoretic structures in the fixed charge transportation problem

Tompkins, Curtis Johnston 08 1900 (has links)
No description available.

Variable selection rules for implicit enumeration

Carroll, Charles Lemuel 05 1900 (has links)
No description available.

Lifted cover inequalities for 0-1 and mixed 0-1 integer programs

Gu, Zonghao 08 1900 (has links)
No description available.

Large scale integer programming : a novel solution method and application

Gzara, Fatma January 2003 (has links)
Integer programming is a powerful modeling tool for a variety of decision making problems such as in telecommunications network design and in routing and scheduling. Integer programming models of realistic problems are large in size and pose serious challenge to available software. This creates an urgent need for solution methodologies that can deal with their size and complexity. In this thesis, we focus on the theoretical development, implementation and testing of a novel methodology: an interior-point branch-and-price algorithm with cut generation for large scale integer programming. / The methodology applies to any integer program but is built for a general class of integer programming that has a large, possibly exponential set of constraints. It starts by applying a decomposition method to the complicating constraints. We focus on Lagrangian relaxation or Dantzig-Wolfe decomposition; both lead to a master problem with an exponential number of variables and constraints. The same analysis applies when one starts by relaxing the exponential constraints and then applying a decomposition method. In both cases, one has to solve iteratively a master problem that is updated by appending violated cuts and columns. For that, we propose a cut and column generation algorithm based on analytic centers. / The cut and column generation algorithm solves a restricted master problem using a primal analytic center cutting plane method to obtain a bound on the original problem. The bound may be poor in quality since most of the complicating constraints are relaxed. To strengthen the bound, we generate violated constraints and append them to the master problem. At this point we use available information to warm-start the solution of the updated restricted master problem. This is done using a dual Newton method to calculate the next analytic center, after which we proceed with the primal method. / The bound is then embedded within a branch-and-bound algorithm leading to a branch-and-price algorithm. In fact, the algorithm is more than a branchand-price since it is able to deal with valid cuts added at the level of the master problem. This is a major step towards an interior-point branch-andcut-and-price algorithm. For an efficient integration of the cut and column generation algorithm within branch-and-bound, we use available information from a parent node to warm-start the calculation of the bound at child nodes. This is achieved by a dual Newton method.

Scheduling Marine Corps entry-level MOS schools /

Detar, Paul J. January 2004 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, Sept. 2004. / Thesis advisor(s): Robert F. Dell. Includes bibliographical references (p. 51-52). Also available online.

New optimality conditions for integer programming and their application to test problem construction

Fleisher, Jay Mark, January 1976 (has links)
Thesis--Wisconsin. / Vita. Includes bibliographical references.

Large scale integer programming : a novel solution method and application

Gzara, Fatma January 2003 (has links)
No description available.

Scheduling Marine Corps entry-level MOS schools

Detar, Paul J. 09 1900 (has links)
Approved for public release; distribution is unlimited / Each year the United States Marine Corps suffers excessive loss of man years from Marines awaiting entry-level schools. During fiscal year 2001 (the most recent complete time-awaiting-training data), Marines exceeded 2,800 man years of time awaiting training. Non-infantry personnel comprise 80% of the more than 30,000 recruits shipped to Marine Corps Recruit Depots each year, but they constitute almost 95% of the 2,800 man-year loss. Marine Corps manpower planners consider the current level of loss unacceptable and believe significant improvement can be gained by optimally scheduling courses at Military Occupational Specialty (MOS) schools. This thesis uses an integer linear program, Entry-Level Course Scheduler (ELCS), to optimize a course schedule that includes recommended seat assignments by MOS and gender. ELCS seeks to minimize the time awaiting training while successfully meeting yearly classification requirements. ELCS results using fiscal year 2003 data indicate time awaiting training can be reduced to only 1,700 man years (a 1,100 man-year improvement, when compared with fiscal year 2001 data). / Captain, United States Marine Corps

Page generated in 0.4406 seconds