A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is bas...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Management science Ročník 50; číslo 6; s. 786 - 796
Hlavní autori: Lulli, Guglielmo, Sen, Suvrajeet
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Linthicum INFORMS 01.06.2004
Institute for Operations Research and the Management Sciences
Edícia:Management Science
Predmet:
ISSN:0025-1909, 1526-5501
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications.
AbstractList In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications. [PUBLICATION ABSTRACT]
In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications.
In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batchsizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications. Key words: stochastic programming; integer programming; batch sizing; branch-and-price algorithm
In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batchsizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications.
In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on two different versions of a multistage stochastic batch-sizing problem (SBSP). One version adopts a recourse formulation, and the other is based on probabilistic constraints. Our algorithmic approach is applicable to both formulations. Our computational results suggest that both classes of problems can be solved using relatively few nodes of a branch-and-price tree. The success of our approach calls for extensions in methodology as well as applications. Reprinted by permission of the Institute for Operations Research and Management Science (INFORMS)
Audience Trade
Academic
Author Lulli, Guglielmo
Sen, Suvrajeet
Author_xml – sequence: 1
  fullname: Lulli, Guglielmo
– sequence: 2
  fullname: Sen, Suvrajeet
BackLink http://econpapers.repec.org/article/inmormnsc/v_3a50_3ay_3a2004_3ai_3a6_3ap_3a786-796.htm$$DView record in RePEc
BookMark eNqFkk1v1DAQhiNUJLYLV84RBzhlsZ3Ejo9pVaCoiEqFs-V4ncRVbAfbS1Uu_HUmTfkQKkLRxFLyPu_MeOY4O3Le6Sx7jtEOk4a9ti6qHUYl2iFMq0fZBteEFnWN8FG2QYjUBeaIP8mOY7xGCLGG0U32vc1PgnRqLKTbF5fBKJ230-CDSaPNex_yD4cpmZjkoPOr5NUoYzIqP3dJDzrkl8EPQVpr3JDfAJO38zwZJZPxLk_-T-REJkhzZb4tWuC6Sdv4NHvcyynqZ_fnNvv85uzT6bvi4uPb89P2olAUlalQDeUM1xVlveIa4b5nijMqK9l1Jdlj3WEEPxrV1FVHdM94r7uyJj3humwILrfZy9V3Dv7LQcckrIlKT5N02h-iKBlHjEKubfbiL-G1PwQHtQmwIXVdEg6iYhUNctLCuN6nINWgnQ5ygqn0Bj63GPMaE8yW7LsH9PDstTXqQeD9CgQ9ayXmYKwMt0BaH5Y5i6-ilDWC1y0EQaiCw0BQiBmCNVQwTsWYLJhVq5kKPsage6FMupsQVGEmgZFYFkjcGS8LJJYF-l30L-xnGf8E7m9laTDY-H_9q1U_mmG8MWG9mQW0EpRGQIPQRUPLHyHG554
CODEN MNSCDI
CitedBy_id crossref_primary_10_1007_s10479_014_1608_4
crossref_primary_10_1007_s10479_021_04388_3
crossref_primary_10_1007_s11750_009_0090_7
crossref_primary_10_1007_s12532_020_00185_4
crossref_primary_10_1016_j_cie_2024_110039
crossref_primary_10_1287_opre_2016_1520
crossref_primary_10_1287_mnsc_2013_1822
crossref_primary_10_1016_j_cor_2005_10_007
crossref_primary_10_1007_s00186_011_0373_2
crossref_primary_10_3138_infor_46_3_155
crossref_primary_10_1016_j_ress_2021_107549
crossref_primary_10_1287_opre_1080_0535
crossref_primary_10_1080_00207543_2012_661088
crossref_primary_10_1109_TPWRS_2005_857016
crossref_primary_10_1109_TPWRS_2005_857015
crossref_primary_10_1007_s10107_018_1315_z
crossref_primary_10_1007_s10479_008_0411_5
crossref_primary_10_1016_j_trb_2024_102929
crossref_primary_10_1287_opre_2022_2366
crossref_primary_10_1016_j_cor_2013_07_004
crossref_primary_10_1287_ijoc_2017_0786
crossref_primary_10_1016_j_cor_2025_107226
crossref_primary_10_1016_j_ejco_2022_100030
crossref_primary_10_1016_j_trb_2009_01_002
crossref_primary_10_1137_16M1075594
crossref_primary_10_1007_s10107_005_0592_5
crossref_primary_10_1080_02331930701779906
crossref_primary_10_1287_ijoc_2020_1044
crossref_primary_10_1109_TPWRS_2009_2036264
crossref_primary_10_1007_s12532_021_00212_y
crossref_primary_10_1016_j_ejor_2024_04_006
crossref_primary_10_1016_j_ejor_2024_02_016
crossref_primary_10_1007_s10107_006_0716_6
crossref_primary_10_1007_s10107_024_02192_y
crossref_primary_10_1007_s10589_017_9947_0
crossref_primary_10_1287_opre_1070_0479
crossref_primary_10_1016_j_ijepes_2020_105817
crossref_primary_10_1016_j_cor_2022_105737
crossref_primary_10_1287_ijoc_1090_0372
crossref_primary_10_1007_s10479_024_06100_7
crossref_primary_10_1080_00207543_2013_855336
crossref_primary_10_1007_s10107_015_0971_5
crossref_primary_10_1016_j_ijpe_2005_05_018
crossref_primary_10_1287_opre_1050_0264
crossref_primary_10_1007_s10107_016_1000_z
crossref_primary_10_1016_j_ejor_2016_03_020
crossref_primary_10_1111_nrm_12267
crossref_primary_10_1016_j_jenvman_2007_01_056
crossref_primary_10_1016_j_orl_2007_10_009
crossref_primary_10_1007_s10287_016_0254_5
crossref_primary_10_1016_j_procs_2018_08_105
crossref_primary_10_1016_j_ejor_2016_08_072
crossref_primary_10_1287_ijoc_2019_0894
crossref_primary_10_1287_opre_1080_0593
crossref_primary_10_1016_j_orl_2013_02_003
crossref_primary_10_1287_ijoc_2020_0963
crossref_primary_10_1287_opre_2019_1842
crossref_primary_10_1016_j_ejor_2017_02_005
crossref_primary_10_1287_opre_1080_0678
crossref_primary_10_1016_j_ejor_2004_09_012
crossref_primary_10_1016_j_trb_2025_103279
crossref_primary_10_1007_s10479_016_2338_6
crossref_primary_10_1007_s12532_017_0128_z
crossref_primary_10_1287_ijoc_2014_0612
crossref_primary_10_1016_j_ejor_2015_04_050
crossref_primary_10_1016_j_orl_2015_03_008
crossref_primary_10_1016_j_ejor_2016_01_048
crossref_primary_10_1016_j_ejor_2020_03_036
crossref_primary_10_1287_ijoo_2019_0029
crossref_primary_10_1287_opre_1110_0988
crossref_primary_10_1016_j_ijpe_2012_09_022
crossref_primary_10_1007_s10287_006_0035_7
crossref_primary_10_1007_s10898_010_9555_3
crossref_primary_10_1155_2012_582323
crossref_primary_10_1016_j_ejor_2017_12_004
crossref_primary_10_1016_j_ejor_2023_12_021
crossref_primary_10_1080_03155986_2021_2015825
crossref_primary_10_1007_s10479_012_1170_x
crossref_primary_10_1007_s10107_010_0385_3
crossref_primary_10_1007_s10107_005_0572_9
crossref_primary_10_1016_j_omega_2019_06_006
crossref_primary_10_1016_j_cor_2023_106149
crossref_primary_10_1287_ijoc_2022_1185
crossref_primary_10_1007_s10287_018_0311_3
crossref_primary_10_1057_jors_2012_28
crossref_primary_10_1016_j_orl_2012_01_007
crossref_primary_10_1080_10286600802284373
crossref_primary_10_1287_mnsc_2013_1865
crossref_primary_10_1007_s10107_016_1006_6
crossref_primary_10_1016_j_cor_2015_09_005
crossref_primary_10_1007_s10479_019_03181_7
crossref_primary_10_1016_j_cor_2023_106182
crossref_primary_10_1061_JWRMD5_WRENG_5950
Cites_doi 10.1287/opre.45.6.831
10.1287/mnsc.13.1.105
10.1023/A:1023062915106
10.1016/0167-6377(93)90002-X
10.1287/mnsc.5.1.89
10.1007/BF02187641
10.1287/ijoc.12.1.2.11900
10.1016/S0377-2217(00)00116-8
10.1287/opre.46.3.316
10.1007/BF01581273
10.1007/BF00247208
10.1287/opre.48.1.111.12453
10.1016/S0167-6377(98)00050-9
10.1016/0167-6377(96)00033-8
10.1287/opre.45.2.188
10.1007/978-1-4615-4975-8
10.1023/A:1013827731218
10.1016/0377-2217(94)90072-8
10.1287/opre.41.3.549
ContentType Journal Article
Copyright COPYRIGHT 2004 Institute for Operations Research and the Management Sciences
Copyright Institute for Operations Research and the Management Sciences Jun 2004
Copyright_xml – notice: COPYRIGHT 2004 Institute for Operations Research and the Management Sciences
– notice: Copyright Institute for Operations Research and the Management Sciences Jun 2004
DBID AAYXX
CITATION
DKI
X2L
3V.
7WY
7WZ
7X5
7XB
87Z
88C
88G
8A3
8AO
8BJ
8FI
8FJ
8FK
8FL
ABUWG
AFKRA
AZQEC
BENPR
BEZIV
CCPQU
DWQXO
FQK
FRNLG
FYUFA
F~G
GHDGH
GNUQQ
JBE
K60
K6~
L.-
M0C
M0T
M2M
PHGZM
PHGZT
PJZUB
PKEHL
PPXIY
PQBIZ
PQBZA
PQEST
PQQKQ
PQUKI
PRINS
PSYQQ
Q9U
DOI 10.1287/mnsc.1030.0164
DatabaseName CrossRef
RePEc IDEAS
RePEc
ProQuest Central (Corporate)
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
Entrepreneurship Database
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Collection
Healthcare Administration Database (Alumni)
Psychology Database (Alumni)
Entrepreneurship Database (Alumni Edition)
ProQuest Pharma Collection
International Bibliography of the Social Sciences (IBSS)
Hospital Premium Collection
Hospital Premium Collection (Alumni Edition)
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni)
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
Business Premium Collection
ProQuest One Community College
ProQuest Central Korea
International Bibliography of the Social Sciences
Business Premium Collection (Alumni)
Health Research Premium Collection
ABI/INFORM Global (Corporate)
Health Research Premium Collection (Alumni)
ProQuest Central Student
International Bibliography of the Social Sciences
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
ABI/INFORM Professional Advanced
ABI/INFORM Global (OCUL)
Healthcare Administration Database
ProQuest Psychology Database
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest Health & Medical Research Collection
ProQuest One Academic Middle East (New)
One Health & Nursing
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest One Psychology
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
ProQuest One Psychology
ProQuest Central Student
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest One Health & Nursing
ProQuest Pharma Collection
ProQuest Central China
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest Health & Medical Research Collection
Health Research Premium Collection
International Bibliography of the Social Sciences (IBSS)
ProQuest Central Korea
Health & Medical Research Collection
ProQuest Central (New)
ABI/INFORM Complete (Alumni Edition)
ProQuest Entrepreneurship
Business Premium Collection
ABI/INFORM Global
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Entrepreneurship (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Health Management
ProQuest Hospital Collection
Health Research Premium Collection (Alumni)
ProQuest Psychology Journals (Alumni)
ProQuest Business Collection
ProQuest Hospital Collection (Alumni)
ProQuest Psychology Journals
ProQuest One Academic UKI Edition
ProQuest Health Management (Alumni Edition)
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest One Academic (New)
ProQuest Central (Alumni)
Business Premium Collection (Alumni)
DatabaseTitleList ABI/INFORM Global (Corporate)


CrossRef


International Bibliography of the Social Sciences (IBSS)

Database_xml – sequence: 1
  dbid: M0T
  name: Healthcare Administration Database
  url: https://search.proquest.com/healthmanagement
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Business
EISSN 1526-5501
EndPage 796
ExternalDocumentID 659156311
A119512171
inmormnsc_v_3a50_3ay_3a2004_3ai_3a6_3ap_3a786_796_htm
10_1287_mnsc_1030_0164
mnsc.1030.0164
mansci_50_6_786
Genre Research Article
Feature
GroupedDBID 08R
1AW
1OL
29M
2AX
3EH
3R3
3V.
4
4.4
5GY
7WY
7X5
85S
8AO
8FI
8FJ
8FL
8VB
AABCJ
AAIKC
AAPBV
AAYJJ
ABBHK
ABEFU
ABIVO
ABNOP
ABPPZ
ABSIS
ABTRL
ABUFD
ABUWG
ABZEH
ACDCL
ACHQT
ACNCT
ACTDY
ACVYA
ADBBV
ADDCT
ADGDI
ADNFJ
AEILP
AENEX
AEUPB
AFDAS
AFFNX
AFKRA
AJPNJ
AKVCP
ALMA_UNASSIGNED_HOLDINGS
AQNXB
AQSKT
AQUVI
AZQEC
B-7
BBAFP
BENPR
BEZIV
BPHCQ
BVXVI
CBXGM
CCKSF
CS3
CWXUR
CYVLN
DU5
DWQXO
EBA
EBE
EBO
EBR
EBS
EBU
ECR
EHE
EJD
EMK
EPL
F20
F5P
FH7
FRNLG
FYUFA
G8K
GENNL
GNUQQ
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
GUPYA
HVGLF
H~9
IAO
IEA
IGG
IOF
IPO
ISM
ITC
JAV
JBC
JPL
JSODD
JST
K6
K60
L8O
LI
M0C
M0T
M2M
MV1
N95
NEJ
NIEAY
P-O
P2P
PQEST
PQQKQ
PQUKI
PRINS
PROAC
QWB
REX
RNS
RPU
SA0
SJN
TH9
TN5
U5U
UKR
VOH
VQA
WH7
X
XFK
XHC
XI7
XXP
XZL
YCJ
YNT
YZZ
ZL0
0R1
41
6XO
ACYGS
AETEA
AFFDN
GROUPED_ABI_INFORM_ARCHIVE
HGD
Y99
ZCG
-~X
.-4
18M
41~
AAAZS
AADHG
AAMNW
AAWTO
AAXLS
AAYXX
ABAWQ
ABDNZ
ABDPE
ABKVW
ABLWH
ABXSQ
ABYYQ
ACGFO
ACHJO
ACXJH
ADEPB
ADMHG
ADNWM
ADULT
AEGXH
AEMOZ
AFAIT
AFFHD
AFTQD
AGKTX
AHAJD
AHQJS
AIAGR
APTMU
ASMEE
BAAKF
CCPQU
CITATION
IPC
IPSME
IPY
ISL
JAAYA
JBMMH
JBZCM
JENOY
JHFFW
JKQEH
JLEZI
JLXEF
JPPEU
K1G
K6~
LPU
OFU
PHGZM
PHGZT
PJZUB
PPXIY
PQBIZ
PQBZA
PSYQQ
UKHRP
XSW
YYP
AABXT
AAYOK
ADYLN
DKI
X2L
7XB
8BJ
8FK
FQK
JBE
L.-
PKEHL
Q9U
ID FETCH-LOGICAL-c603t-c869715467fc9e01ff7c976a4abb32d1eb10c9e8c854b2ef79feb352f29e38213
IEDL.DBID M0C
ISICitedReferencesCount 104
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000222291700007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0025-1909
IngestDate Sun Nov 09 12:08:10 EST 2025
Wed Nov 12 05:11:41 EST 2025
Sun Nov 09 15:01:34 EST 2025
Tue Nov 04 18:46:39 EST 2025
Wed Aug 18 03:11:58 EDT 2021
Tue Nov 18 21:19:39 EST 2025
Sat Nov 29 03:19:01 EST 2025
Tue Jan 05 23:25:07 EST 2021
Fri Jan 15 03:33:49 EST 2021
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 6
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c603t-c869715467fc9e01ff7c976a4abb32d1eb10c9e8c854b2ef79feb352f29e38213
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
OpenAccessLink https://doi.org/10.18452/8281
PQID 213255329
PQPubID 40737
PageCount 11
ParticipantIDs crossref_primary_10_1287_mnsc_1030_0164
highwire_informs_mansci_50_6_786
proquest_miscellaneous_37907660
gale_infotracgeneralonefile_A119512171
crossref_citationtrail_10_1287_mnsc_1030_0164
proquest_journals_213255329
informs_primary_10_1287_mnsc_1030_0164
gale_infotracacademiconefile_A119512171
repec_primary_inmormnsc_v_3a50_3ay_3a2004_3ai_3a6_3ap_3a786_796_htm
ProviderPackageCode Y99
RPU
NIEAY
PublicationCentury 2000
PublicationDate 2004-06-01
PublicationDateYYYYMMDD 2004-06-01
PublicationDate_xml – month: 06
  year: 2004
  text: 2004-06-01
  day: 01
PublicationDecade 2000
PublicationPlace Linthicum
PublicationPlace_xml – name: Linthicum
PublicationSeriesTitle Management Science
PublicationTitle Management science
PublicationYear 2004
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
B10
B11
B12
B13
B14
B15
B16
B17
B18
B19
B1
B2
B3
B4
B5
B6
B7
B8
B9
Desrosiers J. (B10) 1995
Birge J. R. (B6) 1997
References_xml – ident: B12
– ident: B9
– ident: B14
– ident: B10
– ident: B3
– ident: B20
– ident: B1
– ident: B7
– ident: B5
– ident: B25
– ident: B23
– ident: B21
– ident: B18
– ident: B16
– ident: B8
– ident: B11
– ident: B13
– ident: B2
– ident: B4
– ident: B6
– ident: B24
– ident: B22
– ident: B17
– ident: B15
– ident: B19
– ident: B18
  doi: 10.1287/opre.45.6.831
– ident: B25
  doi: 10.1287/mnsc.13.1.105
– ident: B2
  doi: 10.1023/A:1023062915106
– volume-title: Introduction to Stochastic Programming
  year: 1997
  ident: B6
– ident: B15
  doi: 10.1016/0167-6377(93)90002-X
– ident: B24
  doi: 10.1287/mnsc.5.1.89
– ident: B13
  doi: 10.1007/BF02187641
– ident: B12
  doi: 10.1287/ijoc.12.1.2.11900
– ident: B11
  doi: 10.1016/S0377-2217(00)00116-8
– ident: B5
  doi: 10.1287/opre.46.3.316
– ident: B4
  doi: 10.1007/BF01581273
– ident: B16
  doi: 10.1007/BF00247208
– ident: B22
  doi: 10.1287/opre.48.1.111.12453
– ident: B8
  doi: 10.1016/S0167-6377(98)00050-9
– ident: B23
  doi: 10.1016/0167-6377(96)00033-8
– ident: B21
  doi: 10.1287/opre.45.2.188
– ident: B17
  doi: 10.1007/978-1-4615-4975-8
– ident: B20
  doi: 10.1023/A:1013827731218
– ident: B14
  doi: 10.1016/0377-2217(94)90072-8
– ident: B1
  doi: 10.1287/opre.41.3.549
– volume-title: Handbook in Operations Research and Management Science: Networks
  year: 1995
  ident: B10
SSID ssj0007876
Score 2.1430812
Snippet In this paper, we present a branch-and-price method to solve special structured multistage stochastic integer programming problems. We validate our method on...
SourceID proquest
gale
repec
crossref
informs
highwire
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 786
SubjectTerms Algorithms
Batch processing
batch sizing
branch-and-price algorithm
Business studies
Integer programming
Management science
Mathematical models
Prices
Programming
Stochastic processes
stochastic programming
Studies
Title A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems
URI http://mansci.journal.informs.org/cgi/content/abstract/50/6/786
http://econpapers.repec.org/article/inmormnsc/v_3a50_3ay_3a2004_3ai_3a6_3ap_3a786-796.htm
https://www.proquest.com/docview/213255329
https://www.proquest.com/docview/37907660
Volume 50
WOSCitedRecordID wos000222291700007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 1526-5501
  dateEnd: 20201209
  omitProxy: false
  ssIdentifier: ssj0007876
  issn: 0025-1909
  databaseCode: 7WY
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global (OCUL)
  customDbUrl:
  eissn: 1526-5501
  dateEnd: 20201209
  omitProxy: false
  ssIdentifier: ssj0007876
  issn: 0025-1909
  databaseCode: M0C
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Healthcare Administration Database
  customDbUrl:
  eissn: 1526-5501
  dateEnd: 20060731
  omitProxy: false
  ssIdentifier: ssj0007876
  issn: 0025-1909
  databaseCode: M0T
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/healthmanagement
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 1526-5501
  dateEnd: 20201209
  omitProxy: false
  ssIdentifier: ssj0007876
  issn: 0025-1909
  databaseCode: BENPR
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Psychology Database
  customDbUrl:
  eissn: 1526-5501
  dateEnd: 20201209
  omitProxy: false
  ssIdentifier: ssj0007876
  issn: 0025-1909
  databaseCode: M2M
  dateStart: 19870101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/psychology
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lj9MwELbYLUJceCPCQvEBwSls4jR2fEJptSsObFWxCywny3GdptImKU12Jbjw15nJi63E48DB6cGuPelM52GPvyHkpQAXNkh94EAgJ-7EQICSMMlco20KJpZx2YD6fHov5vPo_Fwuutycqkur7HVio6iXpcE98kMGYVMYBky-3Xx1sWgUHq52FTT2yAgdG8zoO_FmgyIGWeR9xVawe7LDbIQY4TAvKoP3zb03CDG1Y5N6zdzDBTfXnNCBrHac0NHWbqy5ZouO7_7nW9wjdzonlMat1NwnN2zxgNzqc-Afkh8xnWLBjczVxdJtKsPT-GIFM9VZToFK2tzbBcdyZelpXZpMI9wzxe3Fld3SRZv0lYNZpLjRS-Nfx-S0Lq9_ZQqmIHNP199x7KKtblM9Ih-Pj85m79yuUoNruBfUrom4FOCMcZEaaT0_TYUBP0dPdJIEbOmDQfCgIzJROEmYTYVMIYgPWcqkDSL4UR6T_aIs7BNCozC0AXYnEBmCFGk_SUOPGS-SzGqtHeL2vFKmgzHHahoXCsMZ4K1C3irkrULeOuT1MH7TAnj8eSSyXiG3YUajuwsKQBdiZKkY0fF8COF8h7zaGblqEcJ_N5D2YqQ6IVI5uCBmrUJPcSUiDnP1Pf8i76AXKdXpmUoN8uSQF0MvKAg89dGFLS8rFQjpCc49h8wakR2WWRc5LItrXKlAAz2B_gYN1SZ8rKFxaBtoQKYSkquszp_-lYoDcrvNbMJdqmdkv95e2ufkprkCkdyOyZ74_GVMRtOj-eLDuPmvNs8zfLKTn8LoR0U
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFLfGhoAL34gyYD7wcQpLnMSJDwhlhWnTSlVpA-3mOa7TVlrS0mRD48JfxP_Ie0kcVomP0w4crB7sOi_Jz-_Def49Ql5E4ML6mQdvwBeBE2gIUFImmKOVycDEMi5qUp_Pg2g4jI-PxWiN_LBnYTCt0urEWlGP5xr3yLcZhE1h6DPxbvHFwaJR-HHVVtBoUHFgLr5CxFa-3X8Pr_clY7sfjvp7TltUwNHc9StHx1xE4DfwKNPCuF6WRRpMsgpUmvps7IHucqEj1nEYpMxkkcgg3gxZxoTxY5AC5r1GNoIAVgdmCrr9TvED9rmtEAt2VrQckRCTbOdFqfF8u_sGKa1WbKC1BJaeuD5WhQ5rueL0bizNwuhLtm_3zn_21O6S262TTZNmVdwja6a4T27YHP8H5HtCd7CgyNRRxdgZIa8STU4nIHk1zSk8FVqfSwbHeWLoYTXXU4V01hS3TydmSUdNUlsOZp_iRjZNfqUB0Gp--S87YOqmzuHsG44dNdV7yofk05Xc_iOyXswL85jQOAyNj90pRL6wSpSXZqHLtBsLZpRSPeJYbEjd0rRjtZBTieEaYEkiliRiSSKWeuR1N37REJT8eSRCTSK6YEat2gMYIBdygMkE2f88CFG9Hnm1MnLSMKD_biC1sJUtaGUOLpaeydCVXEYxh7lsz7_E27QQlq0eLWWH3x7Z6npBAeJXLVWY-Vkp_Ui4Eeduj_TrJdJdZlbkcFm8xrn0FcjjqwtoaBbgZwaNQ1tAAzFlJLicVvmTv0qxRW7uHX0cyMH-8GCT3GqyuHBH7ilZr5Zn5hm5rs8BnsvntWag5OSqF9VPWMagMQ
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3Nb9MwFLfGhiYufE-EAfOBj1No4jR2fECo66iYNlWVBmg347hOW2lJS5MNjQt_F_8d7yVxWSU-TjtwsHKwY78kv_flPL9HyHMBJmyUhfAFItn1uwYclJRJ5httM1CxjMs6qc-nYzEcJqencrRBfrizMBhW6WRiLajHc4N75B0GblMcR0x2sjYqYnQweLv44mMBKfzR6qppNAg5spdfwXsr3xwewKd-wdjg3Yf-e78tMOAbHkSVbxIuBdgQXGRG2iDMMmFAPeuuTtOIjUOQYwF0JCaJuymzmZAZ-J4xy5i0UQIUwbw3yJbogtbEqMGgv1ICwAfcVYsFnSvbfJHgn3TyojR41j14jemt1vSh0wouVXF9xAqN13LNAN5a2oU1V_Tg4M5__Abvktut8U17DbfcIxu2uE-2Xez_A_K9R_ex0MjU18XYH2G-Jdo7mwDl1TSn8IZofV4ZDOqJpSfV3Ew1prmmuK06sUs6aoLdcjAHKG5w096v8ABaza_esg8qcOqfzL7h2FFT1ad8SD5ey-PvkM1iXthHhCZxbCPsTsEjBu7RYZrFATNBIpnVWnvEdzhRpk3fjlVEzhS6cYArhbhSiCuFuPLIq9X4RZO45M8jEXYKkQYzGt0ezAC6MDeY6mFWwBBc19AjL9dGTprM6L8bSB2EVQtglYPpZWYqDhRXIuEwl-v5F3m7Ds6qla-lWmHZI3urXhCM-LdLF3Z-XqpIyEBwHnikX7PLaplZkcOyuMaFijTQE-lLaKgu4DKDxqEtoAGZSkiuplX--K9U7JFt4CV1fDg82iW3muAu3Kh7Qjar5bl9Sm6aC0Dn8lktJCj5fN089RM0Faj3
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=A+Branch-and-Price+Algorithm+for+Multistage+Stochastic+Integer+Programming+with+Application+to+Stochastic+Batch-Sizing+Problems&rft.jtitle=Management+science&rft.au=Lulli%2C+Guglielmo&rft.au=Sen%2C+Suvrajeet&rft.date=2004-06-01&rft.issn=0025-1909&rft.eissn=1526-5501&rft.volume=50&rft.issue=6&rft.spage=786&rft.epage=796&rft_id=info:doi/10.1287%2Fmnsc.1030.0164&rft.externalDBID=n%2Fa&rft.externalDocID=10_1287_mnsc_1030_0164
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0025-1909&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0025-1909&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0025-1909&client=summon