<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

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

dc.citation.epage60en_US
dc.citation.issue1en_US
dc.citation.spage51en_US
dc.citation.volume19en_US
dc.citation.woscount5
dc.contributor.authorDu, DZen_US
dc.contributor.authorHwang, FKen_US
dc.contributor.authorJung, Yen_US
dc.contributor.authorNgo, HQen_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
dc.date.accessioned2014-12-08T15:44:21Z
dc.date.available2014-12-08T15:44:21Z
dc.date.issued2001-01-01en_US
dc.description.abstractWe 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.identifier.doi10.1023/A:1008308211943en_US
dc.identifier.issn0925-5001en_US
dc.identifier.journalJOURNAL OF GLOBAL OPTIMIZATIONen_US
dc.identifier.urihttp://dx.doi.org/10.1023/A:1008308211943en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/29961
dc.identifier.wosnumberWOS:000166049200003
dc.language.isoen_USen_US
dc.subjectinvariant optimal assignmenten_US
dc.subjectconsecutive-k-out-of-nen_US
dc.subjectG cycleen_US
dc.titleOptimal consecutive-k-out-of-(2k+1): G cycleen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
000166049200003.pdf
Size:
62.57 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: