{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/29153"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/29153","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"A Graph Theoretic Approach To Food Combination Problems","abstract":"Graph theory provides a useful representation of, and mathematical toolkit for, analyzing how things are connected together. This collection of research investigates the use of graph theory as a representation of how foods are connected together. The first two studies validate the subject questioning procedure used to create a graph model out of responses and the final study introduces a new approach to using this methodology to optimize field ration menus for the United States Army. In the first study, we began by asking subjects whether or not pairs of ingredients would be appropriate to combine on a salad. Next, using graph theoretic methods, we predicted which combinations of 3-8 components should go together. Subjects were then asked whether or not particular combinations were appropriate to combine on a salad. A paired Wilcoxon test between the predicted and non-predicted combinations was significant for all combination sizes. The second study tested the principle of supercombinatorality, i.e. that food combinations (of more than two items) that are fully compatible on a pairwise basis are more compatible than combinations that are not fully compatible pairwise. This study extended the previous findings to group data. Purchase intent responses to pairs of different pizza toppings were collected and used to predict pizzas (with one to 6 toppings) that would appeal to the entire group. Results showed purchase interest to be higher for the predicted pizzas than for non pre- dicted pizzas supporting the supercombinatorality principle. The final study extends the graph theory representation to military rations known as Meal-Ready-to-Eat or MREs. MRE menus are composed of 11 different food categories (entr´ e, side, snack, etc.) and there are multiple items e available in each category. From these items there are over 22 billion potential menus. Categories and items were screened to create a list of the most important ones and we asked soldiers whether or not pairwise combinations of components were appropriate to combine in a meal. Using graph theoretic tools, predictions were made of optimal MRE menus and rankings were attached to prediction in order to assist the product developers in screening old and new menu concepts.","abstract_html":"Graph theory provides a useful representation of, and mathematical toolkit for, analyzing how things are connected together. This collection of research investigates the use of graph theory as a representation of how foods are connected together. The first two studies validate the subject questioning procedure used to create a graph model out of responses and the final study introduces a new approach to using this methodology to optimize field ration menus for the United States Army. In the first study, we began by asking subjects whether or not pairs of ingredients would be appropriate to combine on a salad. Next, using graph theoretic methods, we predicted which combinations of 3-8 components should go together. Subjects were then asked whether or not particular combinations were appropriate to combine on a salad. A paired Wilcoxon test between the predicted and non-predicted combinations was significant for all combination sizes. The second study tested the principle of supercombinatorality, i.e. that food combinations (of more than two items) that are fully compatible on a pairwise basis are more compatible than combinations that are not fully compatible pairwise. This study extended the previous findings to group data. Purchase intent responses to pairs of different pizza toppings were collected and used to predict pizzas (with one to 6 toppings) that would appeal to the entire group. Results showed purchase interest to be higher for the predicted pizzas than for non pre- dicted pizzas supporting the supercombinatorality principle. The final study extends the graph theory representation to military rations known as Meal-Ready-to-Eat or MREs. MRE menus are composed of 11 different food categories (entr´ e, side, snack, etc.) and there are multiple items e available in each category. From these items there are over 22 billion potential menus. Categories and items were screened to create a list of the most important ones and we asked soldiers whether or not pairwise combinations of components were appropriate to combine in a meal. Using graph theoretic tools, predictions were made of optimal MRE menus and rankings were attached to prediction in order to assist the product developers in screening old and new menu concepts.","abstract_has_math":false,"creators":["Nestrud, Michael"],"institution":"Cornell University","degree_name":"Ph. D., Food Science and Technology","degree_level":"Doctor of Philosophy","degree_discipline":"Food Science and Technology","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Lawless, Harry Thomas"],"committee_members":["Velleman, Paul F","Halpern, Bruce Peter","Acree, Terry Edward"],"year":2011,"date_issued":"2011-05-31","date_published":"2011-05-31","updated_at":"2026-11-19T03:14:48Z","subjects":["graph theory","sensory evaluation","food combinations"],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["7745282"],"render_values":[{"text":"7745282","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/29153","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/29153","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://ecommons.cornell.edu/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Aecommons.cornell.edu%3A1813%2F29153","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Lawless, Harry Thomas"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Velleman, Paul F","Halpern, Bruce Peter","Acree, Terry Edward"]},{"key":"dc:creator","label":"Author","values":["Nestrud, Michael"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2012-06-28T20:54:08Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2012-06-28T20:54:08Z"]},{"key":"dc:date.issued","label":"Date","values":["2011-05-31"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Food Science and Technology"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Food Science and Technology"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Cornell University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["graph theory","sensory evaluation","food combinations"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["7745282"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/29153"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"5dd8138c-6903-41ed-a655-49efeb58eba4\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>A Graph Theoretic Approach To Food Combination Problems</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2011-05-31</PublicationDate> <Authors> <Author> <DisplayName>Nestrud, Michael</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>graph theory</Keyword> <Keyword>sensory evaluation</Keyword> <Keyword>food combinations</Keyword> <Abstract>Graph theory provides a useful representation of, and mathematical toolkit for, analyzing how things are connected together. This collection of research investigates the use of graph theory as a representation of how foods are connected together. The first two studies validate the subject questioning procedure used to create a graph model out of responses and the final study introduces a new approach to using this methodology to optimize field ration menus for the United States Army. In the first study, we began by asking subjects whether or not pairs of ingredients would be appropriate to combine on a salad. Next, using graph theoretic methods, we predicted which combinations of 3-8 components should go together. Subjects were then asked whether or not particular combinations were appropriate to combine on a salad. A paired Wilcoxon test between the predicted and non-predicted combinations was significant for all combination sizes. The second study tested the principle of supercombinatorality, i.e. that food combinations (of more than two items) that are fully compatible on a pairwise basis are more compatible than combinations that are not fully compatible pairwise. This study extended the previous findings to group data. Purchase intent responses to pairs of different pizza toppings were collected and used to predict pizzas (with one to 6 toppings) that would appeal to the entire group. Results showed purchase interest to be higher for the predicted pizzas than for non pre- dicted pizzas supporting the supercombinatorality principle. The final study extends the graph theory representation to military rations known as Meal-Ready-to-Eat or MREs. MRE menus are composed of 11 different food categories (entr´ e, side, snack, etc.) and there are multiple items e available in each category. From these items there are over 22 billion potential menus. Categories and items were screened to create a list of the most important ones and we asked soldiers whether or not pairwise combinations of components were appropriate to combine in a meal. Using graph theoretic tools, predictions were made of optimal MRE menus and rankings were attached to prediction in order to assist the product developers in screening old and new menu concepts.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Nestrud, Michael"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description.abstract","label":"Abstract","values":["Graph theory provides a useful representation of, and mathematical toolkit for, analyzing how things are connected together. This collection of research investigates the use of graph theory as a representation of how foods are connected together. The first two studies validate the subject questioning procedure used to create a graph model out of responses and the final study introduces a new approach to using this methodology to optimize field ration menus for the United States Army. In the first study, we began by asking subjects whether or not pairs of ingredients would be appropriate to combine on a salad. Next, using graph theoretic methods, we predicted which combinations of 3-8 components should go together. Subjects were then asked whether or not particular combinations were appropriate to combine on a salad. A paired Wilcoxon test between the predicted and non-predicted combinations was significant for all combination sizes. The second study tested the principle of supercombinatorality, i.e. that food combinations (of more than two items) that are fully compatible on a pairwise basis are more compatible than combinations that are not fully compatible pairwise. This study extended the previous findings to group data. Purchase intent responses to pairs of different pizza toppings were collected and used to predict pizzas (with one to 6 toppings) that would appeal to the entire group. Results showed purchase interest to be higher for the predicted pizzas than for non pre- dicted pizzas supporting the supercombinatorality principle. The final study extends the graph theory representation to military rations known as Meal-Ready-to-Eat or MREs. MRE menus are composed of 11 different food categories (entr´ e, side, snack, etc.) and there are multiple items e available in each category. From these items there are over 22 billion potential menus. Categories and items were screened to create a list of the most important ones and we asked soldiers whether or not pairwise combinations of components were appropriate to combine in a meal. Using graph theoretic tools, predictions were made of optimal MRE menus and rankings were attached to prediction in order to assist the product developers in screening old and new menu concepts."]},{"key":"dc:description.collection","label":"Dc Description Collection","values":["Cornell Theses and Dissertations"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["A Graph Theoretic Approach To Food Combination Problems"]},{"key":"dspace:entity.type","label":"Dspace Entity Type","values":["Publication"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"cerif:openaire":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"5dd8138c-6903-41ed-a655-49efeb58eba4\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en_US</Language> <Title>A Graph Theoretic Approach To Food Combination Problems</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2011-05-31</PublicationDate> <Authors> <Author> <DisplayName>Nestrud, Michael</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <Keyword>graph theory</Keyword> <Keyword>sensory evaluation</Keyword> <Keyword>food combinations</Keyword> <Abstract>Graph theory provides a useful representation of, and mathematical toolkit for, analyzing how things are connected together. This collection of research investigates the use of graph theory as a representation of how foods are connected together. The first two studies validate the subject questioning procedure used to create a graph model out of responses and the final study introduces a new approach to using this methodology to optimize field ration menus for the United States Army. In the first study, we began by asking subjects whether or not pairs of ingredients would be appropriate to combine on a salad. Next, using graph theoretic methods, we predicted which combinations of 3-8 components should go together. Subjects were then asked whether or not particular combinations were appropriate to combine on a salad. A paired Wilcoxon test between the predicted and non-predicted combinations was significant for all combination sizes. The second study tested the principle of supercombinatorality, i.e. that food combinations (of more than two items) that are fully compatible on a pairwise basis are more compatible than combinations that are not fully compatible pairwise. This study extended the previous findings to group data. Purchase intent responses to pairs of different pizza toppings were collected and used to predict pizzas (with one to 6 toppings) that would appeal to the entire group. Results showed purchase interest to be higher for the predicted pizzas than for non pre- dicted pizzas supporting the supercombinatorality principle. The final study extends the graph theory representation to military rations known as Meal-Ready-to-Eat or MREs. MRE menus are composed of 11 different food categories (entr´ e, side, snack, etc.) and there are multiple items e available in each category. From these items there are over 22 billion potential menus. Categories and items were screened to create a list of the most important ones and we asked soldiers whether or not pairwise combinations of components were appropriate to combine in a meal. Using graph theoretic tools, predictions were made of optimal MRE menus and rankings were attached to prediction in order to assist the product developers in screening old and new menu concepts.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Nestrud, Michael"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Lawless, Harry Thomas"],"dc:contributor.committeemember":["Velleman, Paul F","Halpern, Bruce Peter","Acree, Terry Edward"],"dc:creator":["Nestrud, Michael"],"dc:date.accessioned":["2012-06-28T20:54:08Z"],"dc:date.available":["2012-06-28T20:54:08Z"],"dc:date.issued":["2011-05-31"],"dc:description.abstract":["Graph theory provides a useful representation of, and mathematical toolkit for, analyzing how things are connected together. This collection of research investigates the use of graph theory as a representation of how foods are connected together. The first two studies validate the subject questioning procedure used to create a graph model out of responses and the final study introduces a new approach to using this methodology to optimize field ration menus for the United States Army. In the first study, we began by asking subjects whether or not pairs of ingredients would be appropriate to combine on a salad. Next, using graph theoretic methods, we predicted which combinations of 3-8 components should go together. Subjects were then asked whether or not particular combinations were appropriate to combine on a salad. A paired Wilcoxon test between the predicted and non-predicted combinations was significant for all combination sizes. The second study tested the principle of supercombinatorality, i.e. that food combinations (of more than two items) that are fully compatible on a pairwise basis are more compatible than combinations that are not fully compatible pairwise. This study extended the previous findings to group data. Purchase intent responses to pairs of different pizza toppings were collected and used to predict pizzas (with one to 6 toppings) that would appeal to the entire group. Results showed purchase interest to be higher for the predicted pizzas than for non pre- dicted pizzas supporting the supercombinatorality principle. The final study extends the graph theory representation to military rations known as Meal-Ready-to-Eat or MREs. MRE menus are composed of 11 different food categories (entr´ e, side, snack, etc.) and there are multiple items e available in each category. From these items there are over 22 billion potential menus. Categories and items were screened to create a list of the most important ones and we asked soldiers whether or not pairwise combinations of components were appropriate to combine in a meal. Using graph theoretic tools, predictions were made of optimal MRE menus and rankings were attached to prediction in order to assist the product developers in screening old and new menu concepts."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["7745282"],"dc:identifier.uri":["https://hdl.handle.net/1813/29153"],"dc:language.iso":["en_US"],"dc:subject":["graph theory","sensory evaluation","food combinations"],"dc:title":["A Graph Theoretic Approach To Food Combination Problems"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Food Science and Technology"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Food Science and Technology"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:14:48Z"}