서브메뉴
검색
Discrete Optimization Problems Arising in Supply Chain Optimization
Discrete Optimization Problems Arising in Supply Chain Optimization
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20250211152706
- ISBN
- 9798384053057
- DDC
- 004
- 저자명
- Bansal, Ishan.
- 서명/저자
- Discrete Optimization Problems Arising in Supply Chain Optimization
- 발행사항
- [Sl] : Cornell University, 2024
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2024
- 형태사항
- 139 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 86-03, Section: A.
- 주기사항
- Advisor: Gunluk, Oktay.
- 학위논문주기
- Thesis (Ph.D.)--Cornell University, 2024.
- 초록/해제
- 요약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.
- 일반주제명
- Information technology
- 키워드
- Network Design
- 기타저자
- Cornell University Operations Research and Information Engineering
- 기본자료저록
- Dissertations Abstracts International. 86-03A.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008250123s2024 us c eng d■001000017163420
■00520250211152706
■006m o d
■007cr#unu||||||||
■020 ▼a9798384053057
■035 ▼a(MiAaPQ)AAI31488288
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a004
■1001 ▼aBansal, Ishan.▼0(orcid)0000-0002-5083-309X
■24510▼aDiscrete Optimization Problems Arising in Supply Chain Optimization
■260 ▼a[Sl]▼bCornell University▼c2024
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2024
■300 ▼a139 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 86-03, Section: A.
■500 ▼aAdvisor: Gunluk, Oktay.
■5021 ▼aThesis (Ph.D.)--Cornell University, 2024.
■520 ▼aSupply 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.
■590 ▼aSchool code: 0058.
■650 4▼aInformation technology
■653 ▼aApproximation Algorithms
■653 ▼aDiscrete Optimization
■653 ▼aNetwork Design
■653 ▼aSupply Chain Optimization
■653 ▼aWarehouse Problem
■690 ▼a0796
■690 ▼a0489
■690 ▼a0454
■71020▼aCornell University▼bOperations Research and Information Engineering.
■7730 ▼tDissertations Abstracts International▼g86-03A.
■790 ▼a0058
■791 ▼aPh.D.
■792 ▼a2024
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17163420▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
