東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Decomposition algorithms for stochas...

Ntaimo, Lewis.

FindBook

Google Book

Amazon

博客來

Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions./
作者:	Ntaimo, Lewis.
面頁冊數:	203 p.
附註:	Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4806.
Contained By:	Dissertation Abstracts International65-09B.
標題:	Operations Research. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145114
ISBN:	0496036823

Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions.
Ntaimo, Lewis.

Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions. - 203 p.

Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4806.

Thesis (Ph.D.)--The University of Arizona, 2004.

Some of the most important and challenging problems in computer science and operations research are stochastic combinatorial optimization (SCO) problems. SCO deals with a class of combinatorial optimization models and algorithms in which some of the data are subject to significant uncertainty and evolve over time, and often discrete decisions need to be made before observing complete future data. Therefore, under such circumstances it becomes necessary to develop models and algorithms in which plans are evaluated against possible future scenarios that represent alternative outcomes of data. Consequently, SCO models are characterized by a large number of scenarios, discrete decision variables and constraints.

ISBN: 0496036823Subjects--Topical Terms:

626629
Operations Research.

Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions.
LDR:03343nmm 2200325 4500 001 1849615
005 20051203080720.5
008 130614s2004 eng d
020 $a 0496036823
035 $a (UnM)AAI3145114
035 $a AAI3145114
040 $a UnM $c UnM
100 1 $a Ntaimo, Lewis. $3 1937567
245 1 0 $a Decomposition algorithms for stochastic combinatorial optimization: Computational experiments and extensions.
300 $a 203 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-09, Section: B, page: 4806.
500 $a Director: Suvrajeet Sen.
502 $a Thesis (Ph.D.)--The University of Arizona, 2004.
520 $a Some of the most important and challenging problems in computer science and operations research are stochastic combinatorial optimization (SCO) problems. SCO deals with a class of combinatorial optimization models and algorithms in which some of the data are subject to significant uncertainty and evolve over time, and often discrete decisions need to be made before observing complete future data. Therefore, under such circumstances it becomes necessary to develop models and algorithms in which plans are evaluated against possible future scenarios that represent alternative outcomes of data. Consequently, SCO models are characterized by a large number of scenarios, discrete decision variables and constraints.
520 $a This dissertation focuses on the development of practical decomposition algorithms for large-scale SCO. Stochastic mixed-integer programming (SMIP), the optimization branch concerned with models containing discrete decision variables and random parameters, provides one way for dealing with such decision-making problems under uncertainty. This dissertation studies decomposition algorithms, models and applications for large-scale two-stage SMIP. The theoretical underpinnings of the method are derived from the disjunctive decomposition (D 2) method. We study this class of methods through applications, computations and extensions.
520 $a With regard to applications, we first present a stochastic server location problem (SSLP) which arises in a variety of applications. These models give rise to SMIP problems in which all integer variables are binary. We study the performance of the D2 method with these problems. In order to carry out a more comprehensive study of SSLP problems, we also present certain other valid inequalities for SMIP problems.
520 $a Following our study with SSLP, we also discuss the implementation of the D2 method, and also study its performance on problems in which the second-stage is mixed-integer (binary). The models for which we carry out this experimental study have appeared in the literature as stochastic matching problems, and stochastic strategic supply chain planning problems. Finally, in terms of extensions of the D 2 method, we also present a new procedure in which the first-stage model is allowed to include continuous variables. We conclude this dissertation with several ideas for future research.
590 $a School code: 0009.
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, System Science. $3 1018128
650 4 $a Engineering, Industrial. $3 626639
690 $a 0796
690 $a 0790
690 $a 0546
710 2 0 $a The University of Arizona. $3 1017508
773 0 $t Dissertation Abstracts International $g 65-09B.
790 1 0 $a Sen, Suvrajeet, $e advisor
790 $a 0009
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3145114