東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

New model and solution methodology f...

Wang, Haibo.

Linked to FindBook

Google Book

Amazon

博客來

New model and solution methodology for clique partitioning problem and applications.

Record Type:	Electronic resources : Monograph/item
Title/Author:	New model and solution methodology for clique partitioning problem and applications./
Author:	Wang, Haibo.
Description:	209 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-06, Section: A, page: 2280.
Contained By:	Dissertation Abstracts International65-06A.
Subject:	Business Administration, Management. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3136230
ISBN:	0496834282

New model and solution methodology for clique partitioning problem and applications.
Wang, Haibo.

New model and solution methodology for clique partitioning problem and applications. - 209 p.

Source: Dissertation Abstracts International, Volume: 65-06, Section: A, page: 2280.

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

Clique partitioning problem (CPP) is a form of graph partition problem and has a very broad range of applications. CPP is a non-polynomial (NP)-hard problem upon which much research has been focused concerning lifting inequality constraints from

ISBN: 0496834282Subjects--Topical Terms:

626628
Business Administration, Management.

New model and solution methodology for clique partitioning problem and applications.
LDR:01477nmm 2200301 4500 001 1845797
005 20051024140514.5
008 130614s2004 eng d
020 $a 0496834282
035 $a (UnM)AAI3136230
035 $a AAI3136230
040 $a UnM $c UnM
100 1 $a Wang, Haibo. $3 1933942
245 1 0 $a New model and solution methodology for clique partitioning problem and applications.
300 $a 209 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-06, Section: A, page: 2280.
500 $a Advisers: Bahram Alidaee; Gary A. Kochenberger.
502 $a Thesis (Ph.D.)--The University of Mississippi, 2004.
520 $a Clique partitioning problem (CPP) is a form of graph partition problem and has a very broad range of applications. CPP is a non-polynomial (NP)-hard problem upon which much research has been focused concerning lifting inequality constraints from
520 $a The approach for modeling and algorithm design in the study adopts an idea of "multiple data sources and applications, multiple solution techniques and multiple validation methods in a single study". The computational results highlight the robus
590 $a School code: 0131.
650 4 $a Business Administration, Management. $3 626628
650 4 $a Operations Research. $3 626629
690 $a 0454
690 $a 0796
710 2 0 $a The University of Mississippi. $3 1019522
773 0 $t Dissertation Abstracts International $g 65-06A.
790 1 0 $a Alidaee, Bahram, $e advisor
790 1 0 $a Kochenberger, Gary A., $e advisor
790 $a 0131
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3136230