{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-5156"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-5156","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"Multi-Commodity Flow Models for Logistic Operations within a Contested Environment","abstract":"Today's military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model with random attack scenarios. Both models demonstrate an ability to yield optimal route plans that are resilient in a contested environment.","abstract_html":"Today&#x27;s military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model with random attack scenarios. Both models demonstrate an ability to yield optimal route plans that are resilient in a contested environment.","abstract_has_math":false,"creators":["Strinsky, Isabel"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Mathematical Sciences","degree_department":null,"school":null,"contributors":["Dr. Yongjia Song","Dr. Wayne Goddard","Dr. Matthew Saltzman"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:31:12Z","subjects":["Two-Stage Stochastic Programming","Chance Constraint","Optimization","Military Logistics","Deployment Planning","PMC","Other Applied Mathematics"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/4140","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/4140","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-5156","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Yongjia Song","Dr. Wayne Goddard","Dr. Matthew Saltzman"]},{"key":"dc:creator","label":"Author","values":["Strinsky, Isabel"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2023-07-27T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2023-08-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematical Sciences"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Two-Stage Stochastic Programming","Chance Constraint","Optimization","Military Logistics","Deployment Planning","PMC","Other Applied Mathematics"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/4140"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Today's military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model with random attack scenarios. Both models demonstrate an ability to yield optimal route plans that are resilient in a contested environment."]},{"key":"dc:title","label":"Title","values":["Multi-Commodity Flow Models for Logistic Operations within a Contested Environment"]}]}],"canonical_facts":{"dc:contributor":["Dr. Yongjia Song","Dr. Wayne Goddard","Dr. Matthew Saltzman"],"dc:creator":["Strinsky, Isabel"],"dc:date.available":["2023-07-27T07:00:00Z"],"dc:date.created":["2023-08-01T07:00:00Z"],"dc:description.abstract":["Today's military logistics officers face a difficult challenge, generating route plans for mass deployments within contested environments. The current method of generating route plans is inefficient and does not assess the vulnerability within supply networks and chains. There are few models within the current literature that provide risk-averse solutions for multi-commodity flow models. In this thesis, we discuss two models that have the potential to aid military planners in creating route plans that account for risk and uncertainty. The first model we introduce is a continuous time model with chance constraints. The second model is a two-stage discrete time model with random attack scenarios. Both models demonstrate an ability to yield optimal route plans that are resilient in a contested environment."],"dc:identifier":["https://open.clemson.edu/all_theses/4140"],"dc:subject":["Two-Stage Stochastic Programming","Chance Constraint","Optimization","Military Logistics","Deployment Planning","PMC","Other Applied Mathematics"],"dc:title":["Multi-Commodity Flow Models for Logistic Operations within a Contested Environment"],"thesis:degree_discipline":["Mathematical Sciences"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:31:12Z"}