{"id":{"repo_id":"cornell","oai_identifier":"oai:ecommons.cornell.edu:1813/116390"},"canonical_url":"https://search.ndltd.org/etd/cornell/oai:ecommons.cornell.edu:1813/116390","repository":{"repo_id":"cornell","name":"Cornell University","base_url":"https://ecommons.cornell.edu/server/oai/request"},"display":{"title":"DISCRETE OPTIMIZATION PROBLEMS ARISING IN SUPPLY CHAIN OPTIMIZATION","abstract":"Supply chain optimization is a key component for any business providing supply chain services. In today's competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study the so called warehouse problem arising in production planning and inventory management. We provide some of the first known polynomial time algorithms in certain settings conjectured to be NP-Hard. The warehouse problem has also received increased attention in recent years due to its relevance in studying energy markets. Next, we look at the network design aspect of supply chain optimization and study various classical and recent discrete optimization problems arising here. The goal of network design is to construct cheap networks that satisfy certain connectivity requirements. These problems are often NP-Hard and we devise approximation algorithms for them. The problems studied include F-augmentation, capacitated network design, and the flexible graph connectivity.","abstract_html":"Supply chain optimization is a key component for any business providing supply chain services. In today&#x27;s competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study the so called warehouse problem arising in production planning and inventory management. We provide some of the first known polynomial time algorithms in certain settings conjectured to be NP-Hard. The warehouse problem has also received increased attention in recent years due to its relevance in studying energy markets. Next, we look at the network design aspect of supply chain optimization and study various classical and recent discrete optimization problems arising here. The goal of network design is to construct cheap networks that satisfy certain connectivity requirements. These problems are often NP-Hard and we devise approximation algorithms for them. The problems studied include F-augmentation, capacitated network design, and the flexible graph connectivity.","abstract_has_math":false,"creators":["Bansal, Ishan"],"institution":"Cornell University","degree_name":"Ph. D., Operations Research and Information Engineering","degree_level":"Doctor of Philosophy","degree_discipline":"Operations Research and Information Engineering","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":["Gunluk, Oktay"],"committee_members":["Shmoys, David","Scheinberg, Katya"],"year":2024,"date_issued":"2024-08","date_published":"2024-08","updated_at":"2026-11-19T03:11:32Z","subjects":["Approximation Algorithms","Discrete Optimization","Network Design","Supply Chain Optimization","Warehouse Problem"],"languages":["en"],"rights":["Attribution-NonCommercial-NoDerivatives 4.0 International"],"rights_urls":["https://creativecommons.org/licenses/by-nc-nd/4.0/"],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/tyj3-sd89"],"render_values":[{"text":"https://doi.org/10.7298/tyj3-sd89","href":"https://doi.org/10.7298/tyj3-sd89","code":true}]},{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["16612019"],"render_values":[{"text":"16612019","href":null,"code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 14563","ProQuest Publication ID: 31488288"],"render_values":[{"text":"ProQuest Submission ID: 14563","href":null,"code":true},{"text":"ProQuest Publication ID: 31488288","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/1813/116390","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"https://hdl.handle.net/1813/116390","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%2F116390","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.chair","label":"Chair","values":["Gunluk, Oktay"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Shmoys, David","Scheinberg, Katya"]},{"key":"dc:creator","label":"Author","values":["Bansal, Ishan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-01-14T19:58:50Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2025-01-14T19:58:50Z"]},{"key":"dc:date.issued","label":"Date","values":["2024-08"]},{"key":"dc:relation.uri","label":"Dc Relation URI","values":["https://newcatalog.library.cornell.edu/catalog/16612019"]},{"key":"dc:type","label":"Dc Type","values":["dissertation or thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Operations Research and Information Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Doctor of Philosophy"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph. D., Operations Research and Information Engineering"]},{"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":["Approximation Algorithms","Discrete Optimization","Network Design","Supply Chain Optimization","Warehouse Problem"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["Attribution-NonCommercial-NoDerivatives 4.0 International"]},{"key":"dc:rights.uri","label":"Rights URI","values":["https://creativecommons.org/licenses/by-nc-nd/4.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.bibid","label":"Dc Identifier Bibid","values":["16612019"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.7298/tyj3-sd89"]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["ProQuest Submission ID: 14563","ProQuest Publication ID: 31488288"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/1813/116390"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"cerif:openaire","label":"Cerif Openaire","values":["<Publication xmlns=\"https://www.openaire.eu/cerif-profile/1.1/\" id=\"f6130691-199c-4487-b32f-1d8a2b0592d7\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>DISCRETE OPTIMIZATION PROBLEMS ARISING IN SUPPLY CHAIN OPTIMIZATION</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2024-08</PublicationDate> <DOI>https://doi.org/10.7298/tyj3-sd89</DOI> <Authors> <Author> <DisplayName>Bansal, Ishan</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by-nc-nd/4.0/</License> <Keyword>Approximation Algorithms</Keyword> <Keyword>Discrete Optimization</Keyword> <Keyword>Network Design</Keyword> <Keyword>Supply Chain Optimization</Keyword> <Keyword>Warehouse Problem</Keyword> <Abstract>Supply chain optimization is a key component for any business providing supply chain services. In today's competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study the so called warehouse problem arising in production planning and inventory management. We provide some of the first known polynomial time algorithms in certain settings conjectured to be NP-Hard. The warehouse problem has also received increased attention in recent years due to its relevance in studying energy markets. Next, we look at the network design aspect of supply chain optimization and study various classical and recent discrete optimization problems arising here. The goal of network design is to construct cheap networks that satisfy certain connectivity requirements. These problems are often NP-Hard and we devise approximation algorithms for them. The problems studied include F-augmentation, capacitated network design, and the flexible graph connectivity.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"]},{"key":"cris:virtual.author","label":"Cris Virtual Author","values":["Bansal, Ishan"]},{"key":"cris:virtualsource.collection","label":"Cris Virtualsource Collection","values":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"]},{"key":"dc:description","label":"Description","values":["138 pages"]},{"key":"dc:description.abstract","label":"Abstract","values":["Supply chain optimization is a key component for any business providing supply chain services. In today's competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study the so called warehouse problem arising in production planning and inventory management. We provide some of the first known polynomial time algorithms in certain settings conjectured to be NP-Hard. The warehouse problem has also received increased attention in recent years due to its relevance in studying energy markets. Next, we look at the network design aspect of supply chain optimization and study various classical and recent discrete optimization problems arising here. The goal of network design is to construct cheap networks that satisfy certain connectivity requirements. These problems are often NP-Hard and we devise approximation algorithms for them. The problems studied include F-augmentation, capacitated network design, and the flexible graph connectivity."]},{"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":"dcterms:license","label":"Dcterms License","values":["https://hdl.handle.net/1813/59810.2"]},{"key":"dc:title","label":"Title","values":["DISCRETE OPTIMIZATION PROBLEMS ARISING IN SUPPLY CHAIN OPTIMIZATION"]},{"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=\"f6130691-199c-4487-b32f-1d8a2b0592d7\"> <Type xmlns=\"https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types\">http://purl.org/coar/resource_type/c_1843</Type> <Language>en</Language> <Title>DISCRETE OPTIMIZATION PROBLEMS ARISING IN SUPPLY CHAIN OPTIMIZATION</Title> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2024-08</PublicationDate> <DOI>https://doi.org/10.7298/tyj3-sd89</DOI> <Authors> <Author> <DisplayName>Bansal, Ishan</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <OrgUnit /> </Publisher> </Publishers> <License>https://creativecommons.org/licenses/by-nc-nd/4.0/</License> <Keyword>Approximation Algorithms</Keyword> <Keyword>Discrete Optimization</Keyword> <Keyword>Network Design</Keyword> <Keyword>Supply Chain Optimization</Keyword> <Keyword>Warehouse Problem</Keyword> <Abstract>Supply chain optimization is a key component for any business providing supply chain services. In today's competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study the so called warehouse problem arising in production planning and inventory management. We provide some of the first known polynomial time algorithms in certain settings conjectured to be NP-Hard. The warehouse problem has also received increased attention in recent years due to its relevance in studying energy markets. Next, we look at the network design aspect of supply chain optimization and study various classical and recent discrete optimization problems arising here. The goal of network design is to construct cheap networks that satisfy certain connectivity requirements. These problems are often NP-Hard and we devise approximation algorithms for them. The problems studied include F-augmentation, capacitated network design, and the flexible graph connectivity.</Abstract> <Access xmlns=\"http://purl.org/coar/access_right\" > </Access> </Publication>"],"cris:virtual.author":["Bansal, Ishan"],"cris:virtualsource.collection":["5893a6ea-7af3-41d7-abc6-04bcd26ab5df"],"dc:contributor.chair":["Gunluk, Oktay"],"dc:contributor.committeemember":["Shmoys, David","Scheinberg, Katya"],"dc:creator":["Bansal, Ishan"],"dc:date.accessioned":["2025-01-14T19:58:50Z"],"dc:date.available":["2025-01-14T19:58:50Z"],"dc:date.issued":["2024-08"],"dc:description":["138 pages"],"dc:description.abstract":["Supply chain optimization is a key component for any business providing supply chain services. In today's competitive environment, it is essential to maintain operations at their peak efficiency. We study various discrete optimization problems related to supply chain optimization. First, we study the so called warehouse problem arising in production planning and inventory management. We provide some of the first known polynomial time algorithms in certain settings conjectured to be NP-Hard. The warehouse problem has also received increased attention in recent years due to its relevance in studying energy markets. Next, we look at the network design aspect of supply chain optimization and study various classical and recent discrete optimization problems arising here. The goal of network design is to construct cheap networks that satisfy certain connectivity requirements. These problems are often NP-Hard and we devise approximation algorithms for them. The problems studied include F-augmentation, capacitated network design, and the flexible graph connectivity."],"dc:description.collection":["Cornell Theses and Dissertations"],"dc:format.mimetype":["application/pdf"],"dc:identifier.bibid":["16612019"],"dc:identifier.doi":["https://doi.org/10.7298/tyj3-sd89"],"dc:identifier.other":["ProQuest Submission ID: 14563","ProQuest Publication ID: 31488288"],"dc:identifier.uri":["https://hdl.handle.net/1813/116390"],"dc:language.iso":["en"],"dc:relation.uri":["https://newcatalog.library.cornell.edu/catalog/16612019"],"dc:rights":["Attribution-NonCommercial-NoDerivatives 4.0 International"],"dc:rights.uri":["https://creativecommons.org/licenses/by-nc-nd/4.0/"],"dc:subject":["Approximation Algorithms","Discrete Optimization","Network Design","Supply Chain Optimization","Warehouse Problem"],"dcterms:license":["https://hdl.handle.net/1813/59810.2"],"dc:title":["DISCRETE OPTIMIZATION PROBLEMS ARISING IN SUPPLY CHAIN OPTIMIZATION"],"dc:type":["dissertation or thesis"],"dspace:entity.type":["Publication"],"others:access_status":["open.access"],"thesis:degree_discipline":["Operations Research and Information Engineering"],"thesis:degree_level":["Doctor of Philosophy"],"thesis:degree_name":["Ph. D., Operations Research and Information Engineering"],"thesis:institution_name":["Cornell University"]},"updated_at":"2026-11-19T03:11:32Z"}