ãªã³ã¯ Wikipedia ããããµãã¯åé¡ ããããµãã¯åé¡ï¼ããããµãã¯ããã ããKnapsack problemï¼ã¯ãè¨ç®è¤éæ§çè«ã«ãããè¨ç®ã®é£ããã®è°è«ã®å¯¾è±¡ã¨ãªãåé¡ã®ä¸ã¤ã§ãã容é C ã®ããããµãã¯ãä¸ã¤ã¨ãn 種é¡ã®åç©ï¼åã ãä¾¡å¤ pi, å®¹ç© ciï¼ãä¸ããããã¨ããããããµãã¯ã®å®¹é C ãè¶ ããªãç¯å²ã§ããã¤ãã®åç©ãããããµãã¯ã«è©°ããããããµãã¯ã«å ¥ããåç©ã®ä¾¡å¤ã®åãæ大åããã«ã¯ã©ã®åç©ãé¸ã¹ã°ããããã¨ããæ´æ°è¨ç»åé¡ã§ãããåã種é¡ã®åç©ã1ã¤ã¾ã§ããå ¥ããããªãå ´åï¼xi â {0, 1}ï¼ããåãåç©ããã 1
{{#tags}}- {{label}}
{{/tags}}