Spelling suggestions: "subject:"integer programming"" "subject:"nteger programming""
11 |
Polyhedral structure of the K-median problemZhao, Wenhui, January 2007 (has links)
Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 119-120).
|
12 |
Cost-constrained project scheduling with task durations and costs that may increase over time : demonstrated with the U.S. Army future combat systems /Grose, Roger. January 2004 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, June 2004. / Thesis advisor(s): Robert A. Koyak. Includes bibliographical references (p. 59-61). Also available online.
|
13 |
Two-period, stochastic, supply-chain models with recourse for Naval surface warfare /Avital, Ittai. January 2004 (has links) (PDF)
Thesis (M.S. in Operations Research)--Naval Postgraduate School, March 2004. / Thesis advisor(s): R. Kevin Wood, Moshe Kress, Gerald G. Brown. Includes bibliographical references (p. 47-48). Also available online.
|
14 |
Application of integer programming techniques to industrial scheduling problemsMachado, Mario 08 1900 (has links)
No description available.
|
15 |
Development of controlled computational experiments on integer linear programming proceduresLin, Benjamin Wei-Yuh 12 1900 (has links)
No description available.
|
16 |
Minimal disconnecting sets in directed multi-commodity networksTindall, John Benton 05 1900 (has links)
No description available.
|
17 |
An algorithm for the solution of the general set-covering problem by Euclidean meansCullen, Frank Haywood 12 1900 (has links)
No description available.
|
18 |
Modeling with integer variablesLowe, James Kenneth 05 1900 (has links)
No description available.
|
19 |
Interior-point decomposition methods for integer programming : theory and applicationElhedhli, Samir. January 2001 (has links)
Mixed integer programming (MIP) provides an important modeling and decision support tool for a wide variety of real-life problems. Unfortunately, practical MIPs are large-scale in size and pose serious difficulties to the available solution methodology and software. / This thesis presents a novel solution approach for large-scale mixed integer programming that integrates three bodies of research: interior point methods, decomposition techniques and branch-and-bound approaches. The combination of decomposition concepts and branch-and-bound is commonly known as branch-and-price, while the integration of decomposition concepts and interior point methods lead to the analytic centre cutting plane method (ACCPM). Unfortunately, the use of interior point methods within branch-and-bound methods could not compete with simplex based branch-and-bound due to the inability of "warm" starting. / The motivation for this study stems from the success of branch-and-price and ACCPM in solving integer and non-differentiable optimization problems respectively and the quest for a method that efficiently integrates interior-point methods and branch-and-bound. / The proposed approach is called an Interior Point Branch-and-Price method (IP-B&P) and works as follows. First, a problem's structure is exploited using Lagrangean relaxation. Second, the resulting master problem is solved using ACCPM. Finally, the overall approach is incorporated within a branch-and-bound scheme. The resulting method is more than the combination of three different techniques. It addresses and fixes complications that arise as a result of this integration. This includes the restarting of the interior-point methods, the branching rule and the exploitation of past information as a warm start. / In the first part of the thesis, we give the details of the interior-point branch-and-price method. We start by providing, discussing and implementing new ideas within ACCPM, then detail the IP-B&P method and its different components. To show the practical applicability of IP-B&P, we use the method as a basis for a new solution methodology for the production-distribution system design (PDSD) problem in supply chain management. In this second part of the thesis, we describe a two-level Lagrangean relaxation heuristic for the PDSD. The numerical results show the superiority of the method in providing the optimal solution for most of the problems attempted.
|
20 |
A parallel processing system to solve the 0-1 programming problem /Desai, Bipin C. January 1977 (has links)
No description available.
|
Page generated in 0.1023 seconds