{"id":"https://openalex.org/W2975570667","doi":"https://doi.org/10.1109/isit.2019.8849477","title":"Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming","display_name":"Lower Bounds for Total Storage of Multiset Combinatorial Batch Codes using Linear Programming","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W2975570667","doi":"https://doi.org/10.1109/isit.2019.8849477","mag":"2975570667"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2019.8849477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://dr.ntu.edu.sg/bitstream/10356/146391/2/Lower%20Bounds%20for%20Total%20Storage%20of%20Multiset%20Combinatorial%20Batch%20Codes%20using%20Linear%20Programming_manuscript.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5088037430","display_name":"Yeow Meng Chee","orcid":"https://orcid.org/0000-0001-7823-8068"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Yeow Meng Chee","raw_affiliation_strings":["Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Systems Engineering and Management, National University of Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083157397","display_name":"Han Mao Kiah","orcid":"https://orcid.org/0000-0001-5611-0848"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Han Mao Kiah","raw_affiliation_strings":["School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100323357","display_name":"Hui Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Hui Zhang","raw_affiliation_strings":["School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore"],"affiliations":[{"raw_affiliation_string":"School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5088037430"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13541589,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2364","last_page":"2368"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9729999899864197,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9679999947547913,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multiset","display_name":"Multiset","score":0.9505594968795776},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6349702477455139},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6037864685058594},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6026036739349365},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5638492107391357},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4955810308456421},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.4117226302623749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.39720088243484497},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36041760444641113},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32388967275619507}],"concepts":[{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.9505594968795776},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6349702477455139},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6037864685058594},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6026036739349365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5638492107391357},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4955810308456421},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.4117226302623749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.39720088243484497},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36041760444641113},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32388967275619507},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2019.8849477","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2019.8849477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:dr.ntu.edu.sg:10356/146391","is_oa":true,"landing_page_url":"https://hdl.handle.net/10356/146391","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/146391/2/Lower%20Bounds%20for%20Total%20Storage%20of%20Multiset%20Combinatorial%20Batch%20Codes%20using%20Linear%20Programming_manuscript.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"}],"best_oa_location":{"id":"pmh:oai:dr.ntu.edu.sg:10356/146391","is_oa":true,"landing_page_url":"https://hdl.handle.net/10356/146391","pdf_url":"https://dr.ntu.edu.sg/bitstream/10356/146391/2/Lower%20Bounds%20for%20Total%20Storage%20of%20Multiset%20Combinatorial%20Batch%20Codes%20using%20Linear%20Programming_manuscript.pdf","source":{"id":"https://openalex.org/S4306402609","display_name":"DR-NTU (Nanyang Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I172675005","host_organization_name":"Nanyang Technological University","host_organization_lineage":["https://openalex.org/I172675005"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Paper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2975570667.pdf"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1974719812","https://openalex.org/W2042664741","https://openalex.org/W2055241129","https://openalex.org/W2079125810","https://openalex.org/W2088336724","https://openalex.org/W2792212312","https://openalex.org/W2901747112","https://openalex.org/W2963487294","https://openalex.org/W3112923198","https://openalex.org/W6788023796"],"related_works":["https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668","https://openalex.org/W2780981577","https://openalex.org/W2497804017","https://openalex.org/W2036974767","https://openalex.org/W1599059104"],"abstract_inverted_index":{"The":[0],"class":[1],"of":[2,18,69,73],"multiset":[3],"combinatorial":[4,19],"batch":[5,20],"codes":[6,21],"(MCBCs)":[7],"was":[8],"introduced":[9],"by":[10],"Zhang":[11],"et":[12],"al.":[13],"(2018)":[14],"as":[15],"a":[16,33,38,66],"generalization":[17],"(CBCs).":[22],"MCBCs":[23],"allow":[24],"multiple":[25],"users":[26],"to":[27,45],"retrieve":[28],"items":[29],"in":[30,32,41,85],"parallel":[31],"distributed":[34],"storage":[35,50,72],"system":[36],"and":[37,88],"fundamental":[39],"objective":[40],"this":[42],"study":[43],"is":[44],"determine":[46,90],"the":[47,70,91],"minimum":[48],"total":[49,71],"given":[51],"certain":[52],"requirements.We":[53],"formulate":[54],"an":[55],"integer":[56],"linear":[57,78],"programming":[58],"problem":[59],"so":[60],"that":[61],"its":[62],"optimal":[63],"solution":[64],"provides":[65],"lower":[67,83],"bound":[68],"MCBCs.":[74],"Borrowing":[75],"techniques":[76],"from":[77],"programming,":[79],"we":[80],"improve":[81],"known":[82],"bounds":[84],"some":[86,95],"cases":[87],"also,":[89],"exact":[92],"values":[93],"for":[94],"parameters.":[96]},"counts_by_year":[],"updated_date":"2026-03-25T13:04:00.132906","created_date":"2025-10-10T00:00:00"}