Two-Stage Robust Network Flow and Design Under Demand Uncertainty
We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one...
Saved in:
| Published in: | Operations research Vol. 55; no. 4; pp. 662 - 673 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Linthicum, MD
INFORMS
01.07.2007
Institute for Operations Research and the Management Sciences |
| Subjects: | |
| ISSN: | 0030-364X, 1526-5463 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this advantage often comes at a price: two-stage optimization is, in general, significantly harder than single-stage optimization.
For network flow and design under demand uncertainty, we give a characterization of the first-stage robust decisions with an exponential number of constraints and prove that the corresponding separation problem is -hard even for a network flow problem on a bipartite graph. We show, however, that if the second-stage network topology is totally ordered or an arborescence, then the separation problem is tractable.
Unlike single-stage robust optimization under demand uncertainty, two-stage robust optimization allows one to control conservatism of the solutions by means of an allowed "budget for demand uncertainty." Using a budget of uncertainty, we provide an upper bound on the probability of infeasibility of a robust solution for a random demand vector.
We generalize the approach to multicommodity network flow and design, and give applications to lot-sizing and location-transportation problems. By projecting out second-stage flow variables, we define an upper bounding problem for the two-stage min-max-min optimization problem. Finally, we present computational results comparing the proposed two-stage robust optimization approach with single-stage robust optimization as well as scenario-based two-stage stochastic optimization. |
|---|---|
| AbstractList | We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this advantage often comes at a price: two-stage optimization is, in general, significantly harder than single-stage optimization.
For network flow and design under demand uncertainty, we give a characterization of the first-stage robust decisions with an exponential number of constraints and prove that the corresponding separation problem is -hard even for a network flow problem on a bipartite graph. We show, however, that if the second-stage network topology is totally ordered or an arborescence, then the separation problem is tractable.
Unlike single-stage robust optimization under demand uncertainty, two-stage robust optimization allows one to control conservatism of the solutions by means of an allowed “budget for demand uncertainty.” Using a budget of uncertainty, we provide an upper bound on the probability of infeasibility of a robust solution for a random demand vector.
We generalize the approach to multicommodity network flow and design, and give applications to lot-sizing and location-transportation problems. By projecting out second-stage flow variables, we define an upper bounding problem for the two-stage min-max-min optimization problem. Finally, we present computational results comparing the proposed two-stage robust optimization approach with single-stage robust optimization as well as scenario-based two-stage stochastic optimization. We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this advantage often comes at a price: two-stage optimization is, in general, significantly harder than single-stage optimization. For network flow and design under demand uncertainty, we give a characterization of the first-stage robust decisions with an exponential number of constraints and prove that the corresponding separation problem is NP-hard even for a network flow problem on a bipartite graph. We show, however, that if the second-stage network topology is totally ordered or an arborescence, then the separation problem is tractable. Unlike single-stage robust optimization under demand uncertainty, two-stage robust optimization allows one to control conservatism of the solutions by means of an allowed "budget for demand uncertainty." Using a budget of uncertainty, we provide an upper bound on the probability of infeasibility of a robust solution for a random demand vector. We generalize the approach to multicommodity network flow and design, and give applications to lot-sizing and location-transportation problems. By projecting out second-stage flow variables, we define an upper bounding problem for the two-stage min-max-min optimization problem. Finally, we present computational results comparing the proposed two-stage robust optimization approach with single-stage robust optimization as well as scenario-based two-stage stochastic optimization. [PUBLICATION ABSTRACT] We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one defers a subset of the flow decisions until after the realization of the uncertain demand. Availability of such a recourse action allows one to come up with less conservative solutions compared to single-stage optimization. However, this advantage often comes at a price: two-stage optimization is, in general, significantly harder than single-stage optimization. For network flow and design under demand uncertainty, we give a characterization of the first-stage robust decisions with an exponential number of constraints and prove that the corresponding separation problem is NP-hard even for a network flow problem on a bipartite graph. We show, however, that if the second-stage network topology is totally ordered or an arborescence, then the separation problem is tractable. Unlike single-stage robust optimization under demand uncertainty, two-stage robust optimization allows one to control conservatism of the solutions by means of an allowed "budget for demand uncertainty." Using a budget of uncertainty, we provide an upper bound on the probability of infeasibility of a robust solution for a random demand vector. We generalize the approach to multicommodity network flow and design, and give applications to lot-sizing and location-transportation problems. By projecting out second-stage flow variables, we define an upper bounding problem for the two-stage min-max-min optimization problem. Finally, we present computational results comparing the proposed two-stage robust optimization approach with single-stage robust optimization as well as scenario-based two-stage stochastic optimization. |
| Audience | Trade |
| Author | Zhang, Muhong Atamturk, Alper |
| Author_xml | – sequence: 1 fullname: Atamturk, Alper – sequence: 2 fullname: Zhang, Muhong |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19042676$$DView record in Pascal Francis |
| BookMark | eNqFkc9rFDEUx4NUcFu9ehMGQW-z5ncmx6XaVigK2gVvIZtJpllnkzXJsvS_N8OU7aUiOYQ8Pt_3Xr7fc3AWYrAAvEVwiXAnPsV9sksEBVxCirsXYIEY5i2jnJyBBYQEtoTTX6_Aec5bCKFknC3A6u4Y259FD7b5ETeHXJpvthxj-t1cjfHY6NA3n232Q2jWobepPnZTbR2MTUX7UB5eg5dOj9m-ebwvwPrqy93lTXv7_frr5eq2NUTI0oqO2A1ynZOYY0yckL10HDpuKBPcSiMdcpz3ZoPkBnLNGRJMUupwZyXpHbkA7-e--xT_HGwuahsPKdSRCiOJZP0cqVA7Q4MerfLBxZK0GWywSY_VLudreYV412EixMQvn-Hr6e3Om2cFHx630Nno0SUdjM9qn_xOpweFZPWeC145OnMmxZyTdcr4oouPoQ7wo0JQTaGpKTQ1haam0J72OclOnf8leDcLtrnEdKIxQ1QgBJ8Mmf6Wdvn__T7O_L0f7o8-zaZMwgnMijFFFeeY_AUmqr9p |
| CODEN | OPREAI |
| CitedBy_id | crossref_primary_10_1016_j_tre_2021_102444 crossref_primary_10_1007_s10479_011_1003_3 crossref_primary_10_1111_poms_12887 crossref_primary_10_1007_s11067_009_9103_1 crossref_primary_10_1016_j_trb_2015_03_019 crossref_primary_10_1016_j_automatica_2018_06_054 crossref_primary_10_1007_s10957_025_02818_x crossref_primary_10_1007_s10479_010_0730_1 crossref_primary_10_1016_j_ejor_2012_11_015 crossref_primary_10_1016_j_ejor_2016_11_043 crossref_primary_10_1016_j_trb_2023_04_010 crossref_primary_10_1049_iet_com_2010_0895 crossref_primary_10_1080_0740817X_2011_587865 crossref_primary_10_1016_j_omega_2025_103357 crossref_primary_10_1002_aic_15717 crossref_primary_10_1016_j_endm_2013_05_110 crossref_primary_10_1007_s40314_024_02762_y crossref_primary_10_1007_s10479_013_1371_y crossref_primary_10_1016_j_ejor_2013_09_036 crossref_primary_10_1016_j_trb_2009_08_004 crossref_primary_10_1287_opre_2018_0505 crossref_primary_10_1016_j_cor_2016_12_018 crossref_primary_10_1061__ASCE_CP_1943_5487_0000091 crossref_primary_10_1016_j_omega_2023_102959 crossref_primary_10_1080_03155986_2023_2286889 crossref_primary_10_1016_j_endm_2013_05_106 crossref_primary_10_1002_nav_21726 crossref_primary_10_1177_10591478251356753 crossref_primary_10_1155_2019_7161204 crossref_primary_10_1109_TNET_2012_2185508 crossref_primary_10_1007_s10589_012_9500_0 crossref_primary_10_1016_j_ijpe_2025_109558 crossref_primary_10_1287_ijoo_2023_0007 crossref_primary_10_1002_net_21997 crossref_primary_10_1002_net_21996 crossref_primary_10_1177_10591478251350096 crossref_primary_10_1287_moor_1080_0316 crossref_primary_10_1002_nav_21739 crossref_primary_10_1137_080734510 crossref_primary_10_3390_sym17040589 crossref_primary_10_1002_net_21515 crossref_primary_10_1007_s10696_008_9053_9 crossref_primary_10_1080_10556788_2013_869807 crossref_primary_10_1287_opre_1080_0605 crossref_primary_10_1515_fcds_2017_0004 crossref_primary_10_1002_aic_15255 crossref_primary_10_1016_j_ejor_2023_09_019 crossref_primary_10_1080_15568318_2020_1858374 crossref_primary_10_1007_s10878_011_9422_2 crossref_primary_10_1287_opre_1080_0650 crossref_primary_10_1287_ijoc_2013_0552 crossref_primary_10_1142_S0217595915500384 crossref_primary_10_1016_j_cie_2017_06_001 crossref_primary_10_1016_j_ress_2024_109969 crossref_primary_10_1016_j_omega_2018_06_013 crossref_primary_10_1016_j_trb_2022_05_005 crossref_primary_10_1007_s00170_017_1530_4 crossref_primary_10_1016_j_tra_2017_04_036 crossref_primary_10_1016_j_automatica_2011_12_002 crossref_primary_10_1016_j_ejor_2012_10_029 crossref_primary_10_1016_j_ejor_2014_02_038 crossref_primary_10_1007_s11630_020_1397_9 crossref_primary_10_1002_net_21691 crossref_primary_10_1002_net_21693 crossref_primary_10_1007_s10898_010_9645_2 crossref_primary_10_1080_03155986_2025_2493994 crossref_primary_10_1287_moor_2014_0693 crossref_primary_10_1016_j_ejor_2025_03_027 crossref_primary_10_1016_j_trc_2015_09_010 crossref_primary_10_1016_j_ejor_2017_07_025 crossref_primary_10_1016_j_trb_2024_102893 crossref_primary_10_1287_opre_2013_1200 crossref_primary_10_1016_j_ejor_2019_06_021 crossref_primary_10_1016_j_tre_2025_104013 crossref_primary_10_1007_s10107_014_0789_6 crossref_primary_10_1007_s11067_010_9147_2 crossref_primary_10_1007_s10732_020_09441_1 crossref_primary_10_1016_j_trb_2018_03_015 crossref_primary_10_1109_TPWRS_2011_2169817 crossref_primary_10_1007_s10100_019_00607_2 crossref_primary_10_1016_j_ejor_2011_02_032 crossref_primary_10_1016_j_trb_2021_08_010 crossref_primary_10_1016_j_ijpe_2019_07_037 crossref_primary_10_1007_s10898_014_0208_9 crossref_primary_10_1111_poms_12187 crossref_primary_10_3390_math10224289 crossref_primary_10_3390_en11102646 crossref_primary_10_1016_j_cor_2024_106569 crossref_primary_10_1016_j_tre_2019_03_022 crossref_primary_10_1287_ijoo_2018_0003 crossref_primary_10_1007_s10107_025_02207_2 crossref_primary_10_1080_13675567_2022_2057937 crossref_primary_10_1287_opre_2019_1862 crossref_primary_10_1002_atr_1211 crossref_primary_10_1016_j_automatica_2015_10_046 crossref_primary_10_1287_trsc_1090_0292 crossref_primary_10_1111_poms_13101 crossref_primary_10_1287_ijoc_2021_0306 crossref_primary_10_1109_TAC_2009_2034204 crossref_primary_10_1002_aic_18832 crossref_primary_10_1021_acssuschemeng_6b00188 crossref_primary_10_1287_ijoc_2019_0941 crossref_primary_10_1016_j_omega_2021_102429 crossref_primary_10_1287_opre_2019_1873 crossref_primary_10_1007_s10666_018_9631_5 crossref_primary_10_1016_j_cor_2021_105557 crossref_primary_10_1287_trsc_2017_0814 crossref_primary_10_1002_net_21497 crossref_primary_10_1016_j_cor_2021_105558 crossref_primary_10_1016_j_ejor_2010_09_041 crossref_primary_10_1287_ijoc_2020_0959 crossref_primary_10_1002_nav_21676 crossref_primary_10_1007_s10479_021_04426_0 crossref_primary_10_1287_ijoc_2019_0934 crossref_primary_10_1016_j_cie_2017_11_007 crossref_primary_10_1080_24725854_2020_1725692 crossref_primary_10_1287_trsc_2019_0935 crossref_primary_10_1007_s10589_017_9974_x crossref_primary_10_1002_net_20374 crossref_primary_10_1016_j_trc_2015_04_001 crossref_primary_10_1007_s11590_012_0557_6 crossref_primary_10_1111_poms_13239 crossref_primary_10_1002_nav_21685 crossref_primary_10_1287_ijoo_2021_0069 crossref_primary_10_1111_j_1475_3995_2009_00737_x crossref_primary_10_1155_2020_5649821 crossref_primary_10_1287_mnsc_2023_00053 crossref_primary_10_1109_TNSE_2018_2867817 crossref_primary_10_1287_msom_2023_0372 crossref_primary_10_1287_opre_1070_0457 crossref_primary_10_1016_j_trb_2014_02_005 crossref_primary_10_1007_s10589_020_00207_w crossref_primary_10_3390_su15129847 crossref_primary_10_1016_j_ejor_2025_03_001 crossref_primary_10_1287_ijoc_2014_0606 crossref_primary_10_1016_j_trc_2022_103563 crossref_primary_10_1287_ijoo_2021_0054 crossref_primary_10_1002_aic_16500 crossref_primary_10_1080_0305215X_2024_2435539 crossref_primary_10_1109_TITS_2018_2809642 crossref_primary_10_1016_j_trb_2010_09_002 crossref_primary_10_1287_trsc_2019_0910 crossref_primary_10_1007_s11356_013_2437_8 crossref_primary_10_1002_net_22135 crossref_primary_10_1016_j_compchemeng_2021_107286 crossref_primary_10_1287_ijoc_1100_0380 crossref_primary_10_1287_ijoc_2020_0986 crossref_primary_10_1007_s13675_018_0103_0 crossref_primary_10_1016_j_ijpe_2023_108912 crossref_primary_10_1007_s10287_018_0338_5 crossref_primary_10_1016_j_iot_2025_101540 crossref_primary_10_1108_IJLM_12_2019_0333 crossref_primary_10_1002_net_21727 crossref_primary_10_1007_s10898_023_01286_9 crossref_primary_10_1287_ijoc_2020_1041 crossref_primary_10_1287_ijoc_2020_1042 crossref_primary_10_1287_ijoc_2016_0689 crossref_primary_10_1360_SSI_2025_0115 crossref_primary_10_1287_inte_2014_0786 crossref_primary_10_1016_j_cor_2017_07_002 crossref_primary_10_1016_j_ejor_2020_09_026 crossref_primary_10_1016_j_trc_2022_103903 crossref_primary_10_1287_ijoc_2021_0181 crossref_primary_10_1080_00207543_2022_2098872 crossref_primary_10_1016_j_apm_2019_07_025 crossref_primary_10_1002_net_22149 crossref_primary_10_1287_ijoc_2022_1163 crossref_primary_10_1007_s10479_021_04237_3 crossref_primary_10_1016_j_tre_2019_09_014 crossref_primary_10_1007_s10107_011_0478_7 crossref_primary_10_1287_ijoc_2021_1061 crossref_primary_10_1016_j_compchemeng_2019_03_034 crossref_primary_10_1007_s11590_009_0116_y crossref_primary_10_1016_j_automatica_2013_03_029 crossref_primary_10_1002_net_22236 crossref_primary_10_1016_j_omega_2023_102872 crossref_primary_10_1016_j_endm_2010_05_022 crossref_primary_10_1007_s10479_011_1004_2 crossref_primary_10_1016_j_orl_2011_06_013 crossref_primary_10_1287_mnsc_1120_1543 crossref_primary_10_1016_j_disopt_2014_01_003 crossref_primary_10_1002_aic_15067 crossref_primary_10_1016_j_trc_2022_103593 crossref_primary_10_1287_trsc_2016_0728 crossref_primary_10_1016_j_ejco_2020_100002 crossref_primary_10_1287_mnsc_2015_2183 crossref_primary_10_1016_j_ejor_2020_05_006 crossref_primary_10_1016_j_comnet_2016_06_035 crossref_primary_10_1002_net_22121 crossref_primary_10_1287_opre_2017_1660 crossref_primary_10_1016_j_orl_2013_05_003 crossref_primary_10_1007_s10957_009_9593_5 crossref_primary_10_1287_trsc_2014_0559 crossref_primary_10_1109_TAC_2014_2331415 crossref_primary_10_1111_poms_13311 crossref_primary_10_3390_sym10110588 crossref_primary_10_1007_s11067_022_09584_7 crossref_primary_10_1080_00207543_2015_1056318 crossref_primary_10_1016_j_ejor_2011_08_001 crossref_primary_10_1287_trsc_2015_0645 crossref_primary_10_1007_s10878_014_9718_0 crossref_primary_10_1016_j_cor_2015_09_007 crossref_primary_10_1007_s10696_019_09343_w crossref_primary_10_1287_opre_2019_1969 crossref_primary_10_1016_j_omega_2024_103110 crossref_primary_10_1007_s10479_016_2212_6 crossref_primary_10_1007_s10957_023_02311_3 |
| Cites_doi | 10.1287/ijoc.7.1.44 10.1287/opre.1070.0385 10.1007/BF01585167 10.1007/s10107-003-0396-4 10.1287/opre.21.5.1154 10.1287/opre.1050.0238 10.2140/pjm.1957.7.1073 10.1007/PL00011424 10.1137/S1052623496305717 10.1007/s10107-006-0709-5 10.1007/s10107-005-0678-0 10.1007/s10107-003-0454-y 10.1287/opre.42.4.688 10.1007/978-1-4757-2620-6 10.1287/opre.39.1.119 10.1287/opre.1030.0065 10.1287/moor.23.4.769 10.1007/s10107-005-0677-1 10.1287/moor.28.1.1.14260 10.1090/psapm/010/0114759 10.1287/opre.44.2.286 10.1287/ijoc.1.4.252 10.1007/PL00011380 |
| ContentType | Journal Article |
| Copyright | Copyright 2007 INFORMS 2007 INIST-CNRS COPYRIGHT 2007 Institute for Operations Research and the Management Sciences Copyright Institute for Operations Research and the Management Sciences Jul/Aug 2007 |
| Copyright_xml | – notice: Copyright 2007 INFORMS – notice: 2007 INIST-CNRS – notice: COPYRIGHT 2007 Institute for Operations Research and the Management Sciences – notice: Copyright Institute for Operations Research and the Management Sciences Jul/Aug 2007 |
| DBID | AAYXX CITATION IQODW 3V. 7WY 7WZ 7X7 7XB 87Z 88E 88F 8AL 8AO 8FE 8FG 8FI 8FJ 8FK 8FL 8G5 ABJCF ABUWG AFKRA ARAPS AZQEC BENPR BEZIV BGLVJ CCPQU DWQXO FRNLG FYUFA F~G GHDGH GNUQQ GUQSH HCIFZ JQ2 K60 K6~ K7- K9. L.- L6V M0C M0N M0S M1P M1Q M2O M7S MBDVC P5Z P62 PHGZM PHGZT PJZUB PKEHL PPXIY PQBIZ PQBZA PQEST PQGLB PQQKQ PQUKI PRINS PTHSS Q9U |
| DOI | 10.1287/opre.1070.0428 |
| DatabaseName | CrossRef Pascal-Francis ProQuest Central (Corporate) ABI/INFORM Collection ABI/INFORM Global (PDF only) Health & Medical Collection ProQuest Central (purchase pre-March 2016) ABI/INFORM Collection Medical Database (Alumni Edition) Military Database (Alumni Edition) Computing Database (Alumni Edition) ProQuest Pharma Collection ProQuest SciTech Collection ProQuest Technology Collection ProQuest Hospital Collection Hospital Premium Collection (Alumni Edition) ProQuest Central (Alumni) (purchase pre-March 2016) ABI/INFORM Collection (Alumni) ProQuest Research Library Materials Science & Engineering Collection ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Business Premium Collection Technology Collection ProQuest One Community College ProQuest Central Korea Business Premium Collection (Alumni) Health Research Premium Collection ABI/INFORM Global (Corporate) Health Research Premium Collection (Alumni) ProQuest Central Student ProQuest Research Library SciTech Premium Collection ProQuest Computer Science Collection ProQuest Business Collection (Alumni Edition) ProQuest Business Collection Computer Science Database ProQuest Health & Medical Complete (Alumni) ABI/INFORM Professional Advanced ProQuest Engineering Collection ABI/INFORM Global Computing Database ProQuest Health & Medical Collection Medical Database ProQuest ProQuest Military Collection ProQuest Research Library Engineering Database Research Library (Corporate) Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest Health & Medical Research Collection ProQuest One Academic Middle East (New) ProQuest One Health & Nursing ProQuest One Business ProQuest One Business (Alumni) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China Engineering Collection ProQuest Central Basic |
| DatabaseTitle | CrossRef ProQuest Business Collection (Alumni Edition) Research Library Prep Computer Science Database ProQuest Central Student ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection SciTech Premium Collection ProQuest Military Collection ProQuest Central China ABI/INFORM Complete ProQuest One Applied & Life Sciences Health Research Premium Collection Health & Medical Research Collection ProQuest Central (New) ProQuest Medical Library (Alumni) Engineering Collection Advanced Technologies & Aerospace Collection Business Premium Collection ABI/INFORM Global Engineering Database ProQuest One Academic Eastern Edition ProQuest Hospital Collection ProQuest Technology Collection Health Research Premium Collection (Alumni) ProQuest Business Collection ProQuest Hospital Collection (Alumni) ProQuest Health & Medical Complete ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ABI/INFORM Global (Corporate) ProQuest One Business Technology Collection ProQuest One Academic Middle East (New) ProQuest Health & Medical Complete (Alumni) ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest One Health & Nursing Research Library (Alumni Edition) ProQuest Pharma Collection ProQuest Central ABI/INFORM Professional Advanced ProQuest Health & Medical Research Collection ProQuest Engineering Collection Health and Medicine Complete (Alumni Edition) ProQuest Central Korea ProQuest Research Library ABI/INFORM Complete (Alumni Edition) ProQuest Computing ABI/INFORM Global (Alumni Edition) ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest Military Collection (Alumni Edition) ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest Medical Library Materials Science & Engineering Collection ProQuest One Business (Alumni) ProQuest Central (Alumni) Business Premium Collection (Alumni) |
| DatabaseTitleList | CrossRef ProQuest Business Collection (Alumni Edition) |
| Database_xml | – sequence: 1 dbid: BENPR name: ProQuest Central url: https://www.proquest.com/central sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) Computer Science Business Applied Sciences |
| EISSN | 1526-5463 |
| EndPage | 673 |
| ExternalDocumentID | 1337878251 A168823773 19042676 10_1287_opre_1070_0428 25147110 opre.1070.0428 opres_55_4_662 |
| Genre | Research Article Feature |
| GeographicLocations | United States |
| GeographicLocations_xml | – name: United States |
| GroupedDBID | 02 08R 123 1AW 1OL 29N 2AX 3V. 4.4 7WY 7X7 85S 88E 8AL 8AO 8FE 8FG 8FI 8FJ 8FL 8G5 8V8 92 AABCJ ABBHK ABDEX ABEFU ABJCF ABPPZ ABSIS ABUWG ABWPA ACDCL ACHQT ACIWK ACNCT ACUWV ACVYA ADBBV ADGDI ADNFJ AENEX AEUPB AFFNX AFKRA AJPNJ AKVCP ALMA_UNASSIGNED_HOLDINGS AQNXB AQSKT ARAPS AZQEC B-7 BBAFP BENPR BEZIV BGLVJ BPHCQ BVXVI CBXGM CCKSF CS3 CWXUR CYVLN DWQXO DZ EBA EBE EBO EBR EBS EBU ECR EHE EJD EMI EMK EPL F20 F5P FH7 FRNLG FYUFA G8K GENNL GNUQQ GROUPED_ABI_INFORM_COMPLETE GROUPED_ABI_INFORM_RESEARCH GUPYA GUQSH HCIFZ H~9 IAO ICJ IEA IGG IOF ITC JAV JBC JPL JSODD JST K6 K60 K6V K7- L6V LI M0C M0N M1P M1Q M2O M7S MBDVC MV1 N95 NIEAY P2P P62 PQEST PQQKQ PQUKI PRG PROAC PSQYO PTHSS QVA RNS RPU SA0 TAE TH9 TN5 U5U VQA WH7 X XFK XHC XI7 XJT XXP YNT YZZ ZCG AETEA HGD HVGLF Y99 YHZ ZY4 -DZ -~X 18M AAAZS AAWTO AAXLS AAYOK ABAWQ ABDPE ABKVW ABLWH ABXSQ ABYYQ ACGFO ACHJO ACSVP ACXJH ADEPB ADMHC ADMHG ADNWM ADULT AEGXH AEMOZ AFAIT AFTQD AGKTX AHAJD AHQJS AIAGR ALIPV APTMU ASMEE BAAKF CCPQU HF~ HMCUK IPSME JAAYA JBMMH JBZCM JENOY JHFFW JKQEH JLEZI JLXEF JPPEU K1G K6~ PHGZM PHGZT PQBIZ PQBZA UKHRP XOL XSW ~02 ~92 AADHG AAYXX AFFHD CITATION PJZUB PPXIY PQGLB YYP IQODW 7XB 8FK JQ2 K9. L.- PKEHL PRINS Q9U |
| ID | FETCH-LOGICAL-c379t-783eb1f8f926223f79d9f60f6c4576e9c9f1f66dcb19b06a65175944f28e93df3 |
| IEDL.DBID | 7X7 |
| ISSN | 0030-364X |
| IngestDate | Mon Nov 03 21:38:00 EST 2025 Sat Nov 29 12:57:04 EST 2025 Sat Nov 29 11:02:36 EST 2025 Mon Jul 21 09:15:42 EDT 2025 Tue Nov 18 22:35:02 EST 2025 Sat Nov 29 01:36:22 EST 2025 Thu Jun 19 16:02:47 EDT 2025 Tue Jan 05 23:29:22 EST 2021 Fri Jan 15 03:35:27 EST 2021 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Keywords | Availability Script Conservatism Probabilistic approach Network flow Lot sizing Random vector Separation principle Location problem Optimization Stochastic programming Integer programming Upper bound Uncertain system Transportation problem Network topology network/graphs: applications Multicommodity flow problem Minimax method Budget Bipartite graph programming: integer Infeasibility |
| Language | English |
| License | CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c379t-783eb1f8f926223f79d9f60f6c4576e9c9f1f66dcb19b06a65175944f28e93df3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 |
| PQID | 219193643 |
| PQPubID | 37962 |
| PageCount | 12 |
| ParticipantIDs | pascalfrancis_primary_19042676 jstor_primary_25147110 crossref_citationtrail_10_1287_opre_1070_0428 gale_infotracacademiconefile_A168823773 highwire_informs_opres_55_4_662 gale_infotracgeneralonefile_A168823773 proquest_journals_219193643 informs_primary_10_1287_opre_1070_0428 crossref_primary_10_1287_opre_1070_0428 |
| ProviderPackageCode | Y99 RPU NIEAY |
| PublicationCentury | 2000 |
| PublicationDate | 2007-07-00 |
| PublicationDateYYYYMMDD | 2007-07-01 |
| PublicationDate_xml | – month: 07 year: 2007 text: 2007-07-00 |
| PublicationDecade | 2000 |
| PublicationPlace | Linthicum, MD |
| PublicationPlace_xml | – name: Linthicum, MD – name: Linthicum |
| PublicationTitle | Operations research |
| PublicationYear | 2007 |
| Publisher | INFORMS Institute for Operations Research and the Management Sciences |
| Publisher_xml | – name: INFORMS – name: Institute for Operations Research and the Management Sciences |
| References | B20 B21 B22 B23 B24 B25 B26 B27 B28 B29 B30 B31 B10 B11 B12 B13 B14 B15 B16 B17 B18 B19 B1 B2 B3 B4 B5 B6 B7 B8 B9 Birge J. R. (B13) 1997 Garey M. R. (B20) 1979 Ordóñez F. (B25) 2004 Averbakh I. (B2) 2000; 27 Chen X. (B14) 2006 |
| References_xml | – ident: B12 – ident: B9 – ident: B14 – ident: B10 – ident: B3 – ident: B20 – ident: B1 – ident: B27 – ident: B7 – ident: B5 – ident: B29 – ident: B25 – ident: B23 – ident: B21 – ident: B18 – ident: B16 – ident: B31 – ident: B8 – ident: B11 – ident: B13 – ident: B2 – ident: B26 – ident: B4 – ident: B28 – ident: B6 – ident: B24 – ident: B22 – ident: B17 – ident: B15 – ident: B30 – ident: B19 – ident: B31 doi: 10.1287/ijoc.7.1.44 – volume-title: Introduction to Stochastic Programming year: 1997 ident: B13 – ident: B24 doi: 10.1287/opre.1070.0385 – ident: B30 doi: 10.1007/BF01585167 – ident: B7 doi: 10.1007/s10107-003-0396-4 – ident: B27 doi: 10.1287/opre.21.5.1154 – ident: B11 doi: 10.1287/opre.1050.0238 – ident: B19 doi: 10.2140/pjm.1957.7.1073 – ident: B3 doi: 10.1007/PL00011424 – ident: B15 doi: 10.1137/S1052623496305717 – ident: B1 doi: 10.1007/s10107-006-0709-5 – year: 2004 ident: B25 publication-title: Networks – ident: B16 doi: 10.1007/s10107-005-0678-0 – year: 2006 ident: B14 publication-title: Oper. Res. – ident: B6 doi: 10.1007/s10107-003-0454-y – ident: B18 doi: 10.1287/opre.42.4.688 – ident: B23 doi: 10.1007/978-1-4757-2620-6 – ident: B26 doi: 10.1287/opre.39.1.119 – volume: 27 start-page: 57 year: 2000 ident: B2 publication-title: Oper. Res. – ident: B8 doi: 10.1287/opre.1030.0065 – ident: B4 doi: 10.1287/moor.23.4.769 – ident: B9 doi: 10.1007/s10107-005-0677-1 – ident: B21 doi: 10.1287/moor.28.1.1.14260 – ident: B22 doi: 10.1090/psapm/010/0114759 – ident: B10 doi: 10.1287/opre.44.2.286 – ident: B29 doi: 10.1287/ijoc.1.4.252 – volume-title: Computers and Intractability: A Guide to the Theory of NP-Completeness year: 1979 ident: B20 – ident: B5 doi: 10.1007/PL00011380 |
| SSID | ssj0009565 |
| Score | 2.330711 |
| Snippet | We describe a two-stage robust optimization approach for solving network flow and design problems with uncertain demand. In two-stage network optimization, one... |
| SourceID | proquest gale pascalfrancis crossref jstor informs highwire |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 662 |
| SubjectTerms | applications Applied sciences Commodities Design optimization Evaluation Exact sciences and technology Flows in networks. Combinatorial problems integer Integer programming Integers Inventory control, production control. Distribution Linear programming Logistics Mathematical vectors Network flow problem Network management systems network/graphs Observational research Operational research and scientific management Operational research. Management science Optimization Optimization techniques programming Robust optimization Stochastic analysis Studies Transportation Transportation demand Transportation problem (Operations research) Uncertainty |
| Title | Two-Stage Robust Network Flow and Design Under Demand Uncertainty |
| URI | http://or.journal.informs.org/cgi/content/abstract/55/4/662 https://www.jstor.org/stable/25147110 https://www.proquest.com/docview/219193643 |
| Volume | 55 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVPQU databaseName: ABI/INFORM Collection customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: 7WY dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.proquest.com/abicomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ABI/INFORM Global customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M0C dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/abiglobal providerName: ProQuest – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: P5Z dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: K7- dateStart: 20000101 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: Engineering Database customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M7S dateStart: 20000101 isFulltext: true titleUrlDefault: http://search.proquest.com providerName: ProQuest – providerCode: PRVPQU databaseName: Health & Medical Collection customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: 7X7 dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/healthcomplete providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: BENPR dateStart: 20000101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Military Collection customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M1Q dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/military providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Research Library customDbUrl: eissn: 1526-5463 dateEnd: 20091130 omitProxy: false ssIdentifier: ssj0009565 issn: 0030-364X databaseCode: M2O dateStart: 20000101 isFulltext: true titleUrlDefault: https://search.proquest.com/pqrl providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5BixAcKF2oCIUlB1TgYJqnHZ_QUrpCApaltGXhYiVOXCGVTWlSKv49M4m9dMXrwMVSklnnMeN5ZCffB_Aw4zLnYWGYTNOSJTopWZ5GhmGwirU0Zcw75rnD12IyyWYzObW9OY1tq3Q-sXPUZa3pHfk2rizMNTB-Pjv5yog0iv5ctQwal2GVWLPJzMVMXMDc5T2BQYyuhiczi9mINcI2MYxg4SqCp1QzLMUk55kdXHD3mRMlkI1rWaT-ybzBR2h67otf3HgXm8Zr_3lXN-GGTUr9UW9F63Cpmg_gquuJH8Ca437wrSsYwPULQIYDWLf7G_-xxbF-cgtG--c1w2T2qPL36uKsaf1J33Puj4_rcz-fl_6Lrn_E78iXcOML7TvAebo2hfb7bTgY7-7vvGSWsYHpWMiWiSxG328yQyiEUWyELKXhgeE6wbqmkqj90HBe6iKURcBznmL2IpPERFkl49LEG7Ayr-fVHfBNoFNe5FpwYxId8KLAsJqkVVJF-Os48oA5nSlt4cyJVeNYUVmDOlakY0U6VqRjDx4t5E96II8_S5IJKNI6zqhz-6ECXhdhZalRyDOC-BGxB1tLkkf9E_6d4ANnTsoaU3fSRqWpShTneDtb7sC_rm6jM8KFGCaomGCEgQfDJav8OY-kOllwDzadDSrrqBq1MMC7fz26CdfcS-0gvAcr7elZdR-u6G_t5-Z0iMvuw8dht_iGsPp8dzLdw61XguH4JtihMXxHY_SWRvEex2n66QctNTqT |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEB6VgngcKA1UmEK7ByhwMPVz7T0gFFGiVk0jQGmV22KvvRVSiUvtEvVH8R-ZsXdDI16nHjjanqzX9jevzew3AE9TLjLu59oVcVy4kYoKN4sD7aKzCpXQRcjbznNHw2Q0SicT8X4Jvtu9MFRWaW1ia6iLStEa-TZqFsYa6D_fnH51qWkU_blqO2h0qNgvL2aYsdWv93bw8z4LgsG78dtd1zQVcFWYiMZN0hDNk041EeUFoU5EITT3NFcRht6lwAn6mvNC5b7IPZ7xGB2siCIdpKUICx3iuNfgOtHqUQXZgf_hEscv7xomhGjaeDQxHJGYk2xTRxNMlBPvFeUoCz7QegJLT9xuq6KAtbYlklSvmdX4yXTXa-MXt9H6wsHKf_YW78FdE3Szfqclq7BUTntw09b892DF9rZgxtT14M4losYerJrzNXtheLpf3of-eFa5GKwfl-xjlZ_XDRt1NfVscFLNWDYt2E5bH8Pa5lJ48IXOHeI4bRlGc_EADq_ksddgeVpNy4fAtKdinmcq4VpHyuN5jmFDFJdRGeCvw8AB12JEKkPXTl1DTiSlbYgpSZiShClJmHLg-Vz-tCMq-bMkQU4SynBElZmNGDgv4gKTfZ-nRGGUhA5sLUged2_4d4KbFr7SgLe9aS3jWEaSc3ycLXvhX7Nba0E_F8MAHAMo33NgY0ELfo4jaB0g4Q6sW8xLY4hrOQf8o79e3YRbu-ODoRzujfbX4bZdwPf8x7DcnJ2XT-CG-tZ8rs82WpVn8OmqteMHbkqOsQ |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFH8aHZrgwFhhIgw2H2DAITSJEyc-IFToKqZNUTVtqDeTOPGENJqxZFT70_jveE7ssoqv0w4ck7w6TvJ7X-7z7wE8SxjPmJ8rl0dR4YYyLNwsCpSLzopKrgrK2s5zHw_jNE2mUz5Zge92L4wuq7Q2sTXURSX1GvkANQtjDfSfA2WqIiaj8dvzr65uIKX_aLXdNDqEHJRXc8ze6jf7I_zUz4NgvHf8_oNrGgy4ksa8ceOEoqlSidKkeQFVMS-4Yp5iMsQwvOQ4WV8xVsjc57nHMhahs-VhqIKk5LRQFMe9BasxxZynB6vv9tLJ0TXGX9a1T6Bo6Fg4NYyRmKEMdH8TTJtj77XOWJY8ovULlqy43WSlw9faFkzq6s2sxg-ous4bvziR1jOO1__jd3of7plwnAw7_dmAlXLWhzW7G6AP67brBTFGsA93r1E49mHDnK_JS8Pg_eoBDI_nlYth_GlJjqr8sm5I2lXbk_FZNSfZrCCjtnKGtG2n8OCLPneC47QFGs3VQzi5kcfehN6smpWPgChPRizPZMyUCqXH8hwDijAqwzLAX9PAAdfiRUhD5K77iZwJndAhvoTGl9D4EhpfDrxYyJ93FCZ_ltTwExpxOKLMzBYNnJdmCRNDnyWa3CimDuwuSZ52b_h3gjsWysIAub1pLaJIhIIxfJxde-Ffs9tsFWAhhqE5hla-58D2kkb8HIfrFYKYObBl8S-Mia7FAvyP_3p1B9ZQKcThfnqwBXfsyr7nP4Fec3FZPoXb8lvzub7YNvpP4NNNq8cPuV2Yyg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Two-stage+robust+network+flow+and+design+under+demand+uncertainty&rft.jtitle=Operations+research&rft.au=ATAMT%C3%9CRK%2C+Alper&rft.au=MUHONG+ZHANG&rft.date=2007-07-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0030-364X&rft.volume=55&rft.issue=4&rft.spage=662&rft.epage=673&rft_id=info:doi/10.1287%2Fopre.1070.0428&rft.externalDBID=n%2Fa&rft.externalDocID=19042676 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0030-364X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0030-364X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0030-364X&client=summon |