東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Generating cutting planes through in...

Hickman, Randal Edward.

FindBook

Google Book

Amazon

博客來

Generating cutting planes through inequality merging for integer programming problems.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Generating cutting planes through inequality merging for integer programming problems./
作者:	Hickman, Randal Edward.
面頁冊數:	123 p.
附註:	Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.
Contained By:	Dissertation Abstracts International75-11B(E).
標題:	Engineering, Industrial. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3627737
ISBN:	9781321031706

Generating cutting planes through inequality merging for integer programming problems.
Hickman, Randal Edward.

Generating cutting planes through inequality merging for integer programming problems. - 123 p.

Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.

Thesis (Ph.D.)--Kansas State University, 2014.

Integer Programming (IP) problems are a common type of optimization problem used to solve numerous real world problems. IPs can require exponential computational effort to solve using the branch and bound technique. A popular method to improve solution times is to generate valid inequalities that serve as cutting planes.

ISBN: 9781321031706Subjects--Topical Terms:

626639
Engineering, Industrial.

Generating cutting planes through inequality merging for integer programming problems.
LDR:02611nmm a2200325 4500 001 2055381
005 20141203121528.5
008 170521s2014 ||||||||||||||||| ||eng d
020 $a 9781321031706
035 $a (MiAaPQ)AAI3627737
035 $a AAI3627737
040 $a MiAaPQ $c MiAaPQ
100 1 $a Hickman, Randal Edward. $3 3169033
245 1 0 $a Generating cutting planes through inequality merging for integer programming problems.
300 $a 123 p.
500 $a Source: Dissertation Abstracts International, Volume: 75-11(E), Section: B.
500 $a Adviser: Todd W. Easton.
502 $a Thesis (Ph.D.)--Kansas State University, 2014.
520 $a Integer Programming (IP) problems are a common type of optimization problem used to solve numerous real world problems. IPs can require exponential computational effort to solve using the branch and bound technique. A popular method to improve solution times is to generate valid inequalities that serve as cutting planes.
520 $a This dissertation introduces a new category of cutting planes for general IPs called inequality merging. The inequality merging technique combines two or more low dimensional inequalities, yielding valid inequalities of potentially higher dimension. The dissertation describes several theoretical results of merged inequalities.
520 $a This research applies merging inequalities to a frequently used class of IPs called multiple knapsack (MK) problems. Theoretical results related to merging cover inequalities are presented. These results include: conditions for validity, conditions for facet defining inequalities, merging simultaneously over multiple cover inequalities, sequentially merging several cover inequalities on multiple variables, and algorithms that facilitate the development of merged inequalities. Examples demonstrate each of the theoretical discoveries.
520 $a A computational study experiments with inequality merging techniques using benchmark MK instances. This computational study provides recommendations for implementing merged inequalities, which results in an average decrease of about 9% in computational time for both small and large MK instances. The research validates the effectiveness of using merged inequalities for MK problems and motivates substantial theoretical and computational extensions as future research.
590 $a School code: 0100.
650 4 $a Engineering, Industrial. $3 626639
650 4 $a Operations Research. $3 626629
650 4 $a Engineering, System Science. $3 1018128
690 $a 0546
690 $a 0796
690 $a 0790
710 2 $a Kansas State University. $b Department of Industrial & Manufacturing Systems Engineering. $3 1035704
773 0 $t Dissertation Abstracts International $g 75-11B(E).
790 $a 0100
791 $a Ph.D.
792 $a 2014
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3627737