<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href='static/style.xsl' type='text/xsl'?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T09:13:25Z</responseDate><request verb="GetRecord" identifier="oai:ecommons.cornell.edu:1813/29153" metadataPrefix="dim">https://ecommons.cornell.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:ecommons.cornell.edu:1813/29153</identifier><datestamp>2026-05-14T13:51:57Z</datestamp><setSpec>com_1813_35</setSpec><setSpec>col_1813_47</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Nestrud, Michael</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="chair" lang="en_US">Lawless, Harry Thomas</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Velleman, Paul F</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Halpern, Bruce Peter</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="committeeMember" lang="en_US">Acree, Terry Edward</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-06-28T20:54:08Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-06-28T20:54:08Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2011-05-31</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/1813/29153</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="bibid">7745282</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">en_US</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">graph theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">sensory evaluation</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">food combinations</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">A Graph Theoretic Approach To Food Combination Problems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">dissertation or thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="discipline">Food Science and Technology</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="grantor" lang="en_US">Cornell University</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="level">Doctor of Philosophy</dim:field>
   <dim:field mdschema="thesis" element="degree" qualifier="name">Ph. D., Food Science and Technology</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="collection" authority="https://cornell-ecommons.eks.prod.4science.cloud/handle/1813/47" confidence="600">Cornell Theses and Dissertations</dim:field>
   <dim:field mdschema="cris" element="virtual" qualifier="author" lang="en_US">Nestrud, Michael</dim:field>
   <dim:field mdschema="cris" element="virtualsource" qualifier="collection">5893a6ea-7af3-41d7-abc6-04bcd26ab5df</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="5dd8138c-6903-41ed-a655-49efeb58eba4">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>en_US&lt;/Language>
   	&lt;Title>A Graph Theoretic Approach To Food Combination Problems&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2011-05-31&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Nestrud, Michael&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;Keyword>graph theory&lt;/Keyword>
    &lt;Keyword>sensory evaluation&lt;/Keyword>
    &lt;Keyword>food combinations&lt;/Keyword>
   	&lt;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.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>