{"corpus_id":62138721,"paper_sha":"684d778d3b1bf6e34447f5b7347fed14aa420ba9","doi":"10.1016/J.FOODQUAL.2012.10.001","arxiv_id":null,"pmid":null,"pmcid":null,"mag_id":2071891243,"dblp_id":null,"acl_id":null,"title":"Implementing TURF analysis through binary linear programming","year":2013,"publication_date":"2013-04-01","venue":"","journal":{"name":"Food Quality and Preference","pages":"382-388","volume":"28"},"journal_issn":null,"journal_title":null,"publication_types":[],"pubmed_pub_types":null,"s2_fields_of_study":["Computer Science","Engineering"],"reference_count":16,"citation_count":6,"influential_citation_count":0,"is_open_access":true,"arxiv_categories":null,"arxiv_license":null,"arxiv_journal_ref":null,"mesh_headings":null,"chemicals":null,"comments_corrections":null,"source_flags":1,"s2_open_access_pdf_url":"http://repositori.upf.edu/bitstream/10230/6045/1/1197.pdf","s2_open_access_landing_url":"https://www.semanticscholar.org/paper/684d778d3b1bf6e34447f5b7347fed14aa420ba9","s2_open_access_license":"CCBYNCND","s2_open_access_status":"GREEN","pmc_open_access_pdf_url":null,"pmc_open_access_landing_url":null,"pmc_open_access_license":null,"pmc_open_access_status":null,"unpaywall_open_access_pdf_url":null,"unpaywall_open_access_landing_url":null,"unpaywall_open_access_license":null,"unpaywall_open_access_status":null,"abstract":"This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.","claims":[{"public_id":"cl_760a19a23ae17c7ab9bb86bde37168b3","status":"active","text":"A binary linear programming model can implement Total Unduplicated Reach and Frequency analysis for product line design.","confidence":0.98,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_760a19a23ae17c7ab9bb86bde37168b3"},{"public_id":"cl_71a57673bdd9763a1ac4490ce6f2cb65","status":"active","text":"The exact algorithm is extremely efficient in finding optimal solutions and in computing time for very large problem instances.","confidence":0.96,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_71a57673bdd9763a1ac4490ce6f2cb65"},{"public_id":"cl_69ae7b8fa8d52256a4593c2e603f77d7","status":"active","text":"The proposed approach improves search efficiency compared with previously used algorithms.","confidence":0.93,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_69ae7b8fa8d52256a4593c2e603f77d7"},{"public_id":"cl_5ab04908a19c54961978477c77988913","status":"active","text":"The proposed technique can improve the model to address the main practical drawbacks of TURF analysis.","confidence":0.9,"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/claims/cl_5ab04908a19c54961978477c77988913"}],"concepts":[{"public_id":"co_00e77e40211cf5d31f63fb4c4e266225","status":"active","name":"optimal solutions","description":"Solutions that achieve the best possible objective value under the model.","types":["outcome"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_00e77e40211cf5d31f63fb4c4e266225"},{"public_id":"co_176b916e1c673687a00c117b47af791e","status":"active","name":"product line design","description":"The process of selecting products or product features to form an offering portfolio.","types":["application"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_176b916e1c673687a00c117b47af791e"},{"public_id":"co_256b7eb42f6294663e1f21b67d0d9bb8","status":"active","name":"proposed technique","description":"The technique introduced in the paper for modeling and improving TURF analysis.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_256b7eb42f6294663e1f21b67d0d9bb8"},{"public_id":"co_435ce4b8c64215c68acf3addd1879a5e","status":"active","name":"main practical drawbacks","description":"The principal limitations of TURF analysis as applied in practice.","types":["limitation"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_435ce4b8c64215c68acf3addd1879a5e"},{"public_id":"co_4e6de4af8875a474b937336b55d86874","status":"active","name":"very large instances","description":"Large-scale problem cases used to assess computational performance.","types":["evaluation setting"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_4e6de4af8875a474b937336b55d86874"},{"public_id":"co_65c22a7627a37281caab7b8b5650d5ca","status":"active","name":"algorithms used to date","description":"Previously used algorithms for solving the TURF analysis problem.","types":["baseline methods"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_65c22a7627a37281caab7b8b5650d5ca"},{"public_id":"co_730aa4c121f5f1811a92d6cbfb1b4867","status":"active","name":"Total Unduplicated Reach and Frequency analysis","description":"A market research method for selecting items to maximize unique reach and frequency across a target audience.","types":["method"],"aliases":["TURF analysis","TURF"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_730aa4c121f5f1811a92d6cbfb1b4867"},{"public_id":"co_7547eb16103dcc30b864e415419d5961","status":"active","name":"search efficiency","description":"The effectiveness and computational effort required to search for a solution.","types":["performance measure"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_7547eb16103dcc30b864e415419d5961"},{"public_id":"co_76e9726eb22b57a1a06b7c461c94cb43","status":"active","name":"exact algorithm","description":"An algorithm that searches for provably optimal solutions to the optimization problem.","types":["method"],"aliases":[],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_76e9726eb22b57a1a06b7c461c94cb43"},{"public_id":"co_faf25f93a5e0c8a9688259e92c9dbee0","status":"active","name":"binary linear programming model","description":"An optimization model that uses binary decision variables and linear constraints.","types":["method","optimization model"],"aliases":["binary linear programming"],"contributors":[{"id":1,"public_id":"12632b8b5f","public_label":"Anonymous (12632b8b5f)","roles":["extraction"],"url":"https://sah.borca.ai/u/12632b8b5f"}],"url":"https://sah.borca.ai/concepts/co_faf25f93a5e0c8a9688259e92c9dbee0"}],"external_ids":{"DOI":"10.1016/J.FOODQUAL.2012.10.001","ArXiv":null,"PubMed":null,"PubMedCentral":null,"MAG":2071891243,"DBLP":null,"ACL":null},"open_access":{"is_open_access":true,"pdf_url":"http://repositori.upf.edu/bitstream/10230/6045/1/1197.pdf","landing_url":"https://www.semanticscholar.org/paper/684d778d3b1bf6e34447f5b7347fed14aa420ba9","source":"semantic_scholar","pdf_url_source":"semantic_scholar_open_access_pdf","license":"CCBYNCND","status":"GREEN","reason":null},"reference_availability":{"status":"available","references_indexed":true,"full_text_available":false,"full_text_source":null,"count_basis":"semantic_scholar_metadata","extraction_status":"not_applicable","reason":null},"source":{"provider":"episteme2","base_corpus":"semantic_scholar_dump","freshness_mode":"unknown","basis":["semantic_scholar_metadata","postgres_metadata"],"limits":["paper metadata is based on indexed upstream scholarly datasets","claims and concepts are available only for extracted papers","absence of claims or concepts means no extracted graph data is available in this response"],"status":"available","degraded":false,"degraded_reasons":[],"diagnostics":{"status":"available","degraded":false,"degraded_reasons":[],"metadata_status":"available","graph_status":"available","abstract_status":"available"},"source_flags":1},"paper_id":638859,"paper_uid":"6755a55c-f82d-4fb6-945a-984125aae6b0","canonical_identity":{"paper_id":638859,"paper_uid":"6755a55c-f82d-4fb6-945a-984125aae6b0","identity_status":"available","lookup_basis":"semantic_scholar_external_id","compatibility_path":"corpus_id"},"url":"https://sah.borca.ai/papers/62138721"}