{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1390282763040058752.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.1587/transfun.e101.a.1375"}},{"identifier":{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/transfun/E101.A/9/E101.A_1375/_pdf"}},{"identifier":{"@type":"NAID","@value":"130007479540"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@language":"en","@value":"Fast Enumeration of All Pareto-Optimal Solutions  for 0-1 Multi-Objective Knapsack Problems Using ZDDs"}],"dc:language":"en","description":[{"type":"abstract","notation":[{"@language":"en","@value":"<p>Finding Pareto-optimal solutions is a basic approach in multi-objective combinatorial optimization. In this paper, we focus on the 0-1 multi-objective knapsack problem, and present an algorithm to enumerate all its Pareto-optimal solutions, which improves upon the method proposed by Bazgan et al. Our algorithm is based on dynamic programming techniques using an efficient data structure called zero-suppressed binary decision diagram (ZDD), which handles a set of combinations compactly. In our algorithm, we utilize ZDDs for storing all the feasible solutions compactly, and pruning inessential partial solutions as quickly as possible. As an output of the algorithm, we can obtain a useful ZDD indexing all the Pareto-optimal solutions. The results of our experiments show that our algorithm is faster than the previous method for various types of three- and four-objective instances, which are difficult problems to solve.</p>"}],"abstractLicenseFlag":"disallow"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1410282763040058753","@type":"Researcher","personIdentifier":[{"@type":"NRID","@value":"9000398137859"}],"foaf:name":[{"@language":"en","@value":"SUZUKI Hirofumi"}],"jpcoar:affiliationName":[{"@language":"en","@value":"Graduate School of Information Science and Technology, Hokkaido University"}]},{"@id":"https://cir.nii.ac.jp/crid/1420282801182805760","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"10374612"},{"@type":"NRID","@value":"1000010374612"},{"@type":"ORCID","@value":"0000-0002-1397-1020"},{"@type":"CINII_AUTHOR_ID","@value":"DA10308895"},{"@type":"URI","@value":"https://ci.nii.ac.jp/author/DA10308895#entity"},{"@type":"URI","@value":"https://viaf.org/viaf/NII%7CDA10308895"},{"@type":"NRID","@value":"9000021609293"},{"@type":"NRID","@value":"9000403576574"},{"@type":"NRID","@value":"9000278472604"},{"@type":"NRID","@value":"9000415226020"},{"@type":"NRID","@value":"9000412549595"},{"@type":"NRID","@value":"9000412549392"},{"@type":"NRID","@value":"9000410149578"},{"@type":"NRID","@value":"9000404230271"},{"@type":"NRID","@value":"9000404225952"},{"@type":"NRID","@value":"9000021538092"},{"@type":"NRID","@value":"9000398624029"},{"@type":"NRID","@value":"9000404238820"},{"@type":"NRID","@value":"9000362197873"},{"@type":"NRID","@value":"9000353367121"},{"@type":"NRID","@value":"9000412549498"},{"@type":"NRID","@value":"9000412549784"},{"@type":"NRID","@value":"9000412549371"},{"@type":"NRID","@value":"9000412549385"},{"@type":"NRID","@value":"9000412549388"},{"@type":"NRID","@value":"9000411024176"},{"@type":"NRID","@value":"9000356550993"},{"@type":"NRID","@value":"9000404227887"},{"@type":"NRID","@value":"9000365541668"},{"@type":"NRID","@value":"9000240076473"},{"@type":"NRID","@value":"9000412549654"},{"@type":"NRID","@value":"9000404228285"},{"@type":"NRID","@value":"9000018632503"},{"@type":"NRID","@value":"9000351082875"},{"@type":"NRID","@value":"9000244006916"},{"@type":"NRID","@value":"9000394069514"},{"@type":"NRID","@value":"9000410149580"},{"@type":"NRID","@value":"9000404673770"},{"@type":"NRID","@value":"9000404241794"},{"@type":"NRID","@value":"9000394070717"},{"@type":"NRID","@value":"9000404277566"},{"@type":"NRID","@value":"9000412549611"},{"@type":"NRID","@value":"9000412549573"},{"@type":"NRID","@value":"9000283636402"},{"@type":"NRID","@value":"9000107381495"},{"@type":"NRID","@value":"9000338689602"},{"@type":"NRID","@value":"9000414943382"},{"@type":"NRID","@value":"9000409337695"},{"@type":"NRID","@value":"9000404238837"},{"@type":"NRID","@value":"9000375905814"},{"@type":"NRID","@value":"9000397665128"},{"@type":"NRID","@value":"9000283209711"},{"@type":"NRID","@value":"9000404242296"},{"@type":"NRID","@value":"9000397663072"},{"@type":"NRID","@value":"9000107380924"},{"@type":"NRID","@value":"9000239866542"},{"@type":"NRID","@value":"9000409624348"},{"@type":"NRID","@value":"9000404230578"},{"@type":"NRID","@value":"9000403576565"},{"@type":"NRID","@value":"9000242793336"},{"@type":"NRID","@value":"9000411965601"},{"@type":"NRID","@value":"9000412357094"},{"@type":"NRID","@value":"9000398137860"},{"@type":"NRID","@value":"9000397666556"},{"@type":"NRID","@value":"9000403580345"},{"@type":"NRID","@value":"9000398623995"},{"@type":"NRID","@value":"9000413566906"},{"@type":"NRID","@value":"9000412549908"},{"@type":"NRID","@value":"9000411648444"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/hjkl"}],"foaf:name":[{"@language":"en","@value":"MINATO Shin-ichi"}],"jpcoar:affiliationName":[{"@language":"en","@value":"Graduate School of Information Science and Technology, Hokkaido University"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"09168508"},{"@type":"EISSN","@value":"17451337"}],"prism:publicationName":[{"@language":"en","@value":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"@language":"en","@value":"IEICE Trans. Fundamentals"}],"dc:publisher":[{"@language":"en","@value":"The Institute of Electronics, Information and Communication Engineers"},{"@language":"ja","@value":"一般社団法人 電子情報通信学会"}],"prism:publicationDate":"2018-09-01","prism:volume":"E101.A","prism:number":"9","prism:startingPage":"1375","prism:endingPage":"1382"},"reviewed":"false","url":[{"@id":"https://www.jstage.jst.go.jp/article/transfun/E101.A/9/E101.A_1375/_pdf"}],"availableAt":"2018-09-01","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=0-1%20multi-objective%20knapsack%20problem","dc:title":"0-1 multi-objective knapsack problem"},{"@id":"https://cir.nii.ac.jp/all?q=ZDD","dc:title":"ZDD"},{"@id":"https://cir.nii.ac.jp/all?q=enumeration","dc:title":"enumeration"},{"@id":"https://cir.nii.ac.jp/all?q=dynamic%20programming","dc:title":"dynamic programming"},{"@id":"https://cir.nii.ac.jp/all?q=dominance%20relation","dc:title":"dominance relation"}],"project":[{"@id":"https://cir.nii.ac.jp/crid/1040000782434241536","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"15H05711"},{"@type":"JGN","@value":"JP15H05711"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-15H05711/"}],"notation":[{"@language":"ja","@value":"離散構造処理系の基盤アルゴリズムの研究"},{"@language":"en","@value":"Research on Fundamental Algorithms of Discrete Structure Manipulation Systems"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1050306506465468032","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@language":"en","@value":"Zero-suppressed BDDs and their applications"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292620156360704","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Generating the Discrete Efficient Frontier to the Capital Budgeting Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855571123710976","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A multiobjective programming approach for selecting non-independent transportation investment alternatives"}]},{"@id":"https://cir.nii.ac.jp/crid/1361699995308879744","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Solving bicriteria 0–1 knapsack problems using a labeling algorithm"}]},{"@id":"https://cir.nii.ac.jp/crid/1362262945030398848","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Knapsack Problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1362262945609782016","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case"}]},{"@id":"https://cir.nii.ac.jp/crid/1362262945899048192","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Solving efficiently the 0–1 multi-objective knapsack problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825893922630656","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Zero-suppressed BDDs for set manipulation in combinatorial problems"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825895293432704","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A GRASP Algorithm for the Multi-Objective Knapsack Problem"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107370024652928","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Decision Diagrams for Optimization"}]},{"@id":"https://cir.nii.ac.jp/crid/1363670319125794304","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The multiobjective multidimensional knapsack problem: a survey and a new approach"}]},{"@id":"https://cir.nii.ac.jp/crid/1363951796146526976","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A survey and annotated bibliography of multiobjective combinatorial optimization"}]}],"dataSourceIdentifier":[{"@type":"JALC","@value":"oai:japanlinkcenter.org:2004983286"},{"@type":"CROSSREF","@value":"10.1587/transfun.e101.a.1375"},{"@type":"CIA","@value":"130007479540"},{"@type":"KAKEN","@value":"PRODUCT-22227478"},{"@type":"OPENAIRE","@value":"doi_dedup___::2dac921a20254a513f2b8459ed5c7f48"}]}