Optimal consecutive-k-out-of-(2k+1): G cycle

Full metadata record

DC Field	Value	Language
dc.contributor.author	Du, DZ	en_US
dc.contributor.author	Hwang, FK	en_US
dc.contributor.author	Jung, Y	en_US
dc.contributor.author	Ngo, HQ	en_US
dc.date.accessioned	2014-12-08T15:44:21Z	-
dc.date.available	2014-12-08T15:44:21Z	-
dc.date.issued	2001-01-01	en_US
dc.identifier.issn	0925-5001	en_US
dc.identifier.uri	http://dx.doi.org/10.1023/A:1008308211943	en_US
dc.identifier.uri	http://hdl.handle.net/11536/29961	-
dc.description.abstract	We present a complete proof for the invariant optimal assignment for consecutive-k-out-of-(2k + 1): G cycle, which was proposed by Zuo and Kao in 1990 with an incomplete proof, pointed out recently by Jalali, Hawkes, Cui and Hwang.	en_US
dc.language.iso	en_US	en_US
dc.subject	invariant optimal assignment	en_US
dc.subject	consecutive-k-out-of-n	en_US
dc.subject	G cycle	en_US
dc.title	Optimal consecutive-k-out-of-(2k+1): G cycle	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1023/A:1008308211943	en_US
dc.identifier.journal	JOURNAL OF GLOBAL OPTIMIZATION	en_US
dc.citation.volume	19	en_US
dc.citation.issue	1	en_US
dc.citation.spage	51	en_US
dc.citation.epage	60	en_US
dc.contributor.department	應用數學系	zh_TW
dc.contributor.department	Department of Applied Mathematics	en_US
dc.identifier.wosnumber	WOS:000166049200003	-
dc.citation.woscount	5	-
Appears in Collections:	Articles

Files in This Item:

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.