A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems

We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0–1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0–1 variables and continuous variables, while the constraints in the second stage have only c...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research Jg. 36; H. 9; S. 2590 - 2600
Hauptverfasser: Escudero, L.F., Garín, M.A., Merino, M., Pérez, G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kidlington Elsevier Ltd 01.09.2009
Elsevier
Pergamon Press Inc
Schlagworte:
Algorithms
Applied sciences
Benders decomposition
Branch-and-fix coordination
Exact sciences and technology
Integer programming
Mathematical programming
Nonanticipativity constraints
Operational research and scientific management
Operational research. Management science
Problem solving
Splitting variables
Stochastic models
Studies
Twin node family
Two-stage stochastic integer programming
Twin node family
Two-stage stochastic integer programming
Branch-and-fix coordination
Splitting variables
Benders decomposition
Nonanticipativity constraints
Script
Partition method
Algorithmics
Cluster
Linear programming
Stochastic programming
Integer programming
Zero one programming
Deterministic model
Mixed problem
Large scale
ISSN:0305-0548, 1873-765X, 0305-0548
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0–1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0–1 variables and continuous variables, while the constraints in the second stage have only continuous. The approach uses the twin node family concept within the algorithmic framework, the so-called branch-and-fix coordination, in order to satisfy the nonanticipativity constraints. At the same time we consider a scenario cluster Benders decomposition scheme for solving large-scale LP submodels given at each TNF integer set. Some computational results are presented to demonstrate the efficiency of the proposed approach.
AbstractList We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0–1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0–1 variables and continuous variables, while the constraints in the second stage have only continuous. The approach uses the twin node family concept within the algorithmic framework, the so-called branch-and-fix coordination, in order to satisfy the nonanticipativity constraints. At the same time we consider a scenario cluster Benders decomposition scheme for solving large-scale LP submodels given at each TNF integer set. Some computational results are presented to demonstrate the efficiency of the proposed approach.
We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0-1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0-1 variables and continuous variables, while the constraints in the second stage have only continuous. The approach uses the twin node family concept within the algorithmic framework, the so-called branch-and-fix coordination, in order to satisfy the nonanticipativity constraints. At the same time we consider a scenario cluster Benders decomposition scheme for solving large-scale LP submodels given at each TNF integer set. Some computational results are presented to demonstrate the efficiency of the proposed approach. [PUBLICATION ABSTRACT]
We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0-1 first stage variables. The constraints in the first stage of the deterministic equivalent model have 0-1 variables and continuous variables, while the constraints in the second stage have only continuous. The approach uses the twin node family concept within the algorithmic framework, the so-called branch-and-fix coordination, in order to satisfy the nonanticipativity constraints. At the same time we consider a scenario cluster Benders decomposition scheme for solving large-scale LP submodels given at each TNF integer set. Some computational results are presented to demonstrate the efficiency of the proposed approach.
Author Garín, M.A.
Pérez, G.
Escudero, L.F.
Merino, M.
Author_xml – sequence: 1
  givenname: L.F.
  surname: Escudero
  fullname: Escudero, L.F.
  email: laureano.escudero@urjc.es
  organization: Dpto. de Estadística e Investigación Operativa, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain
– sequence: 2
  givenname: M.A.
  surname: Garín
  fullname: Garín, M.A.
  email: mariaaraceli.garin@ehu.es
  organization: Dpto. de Economía Aplicada III, Fac. CC. Económicas y Empresariares, UPV/EHU, Universidad del País Vasco, Avd. Lehendakari Aguirre 83, 48015 Bilbao, Vizcaya, Spain
– sequence: 3
  givenname: M.
  surname: Merino
  fullname: Merino, M.
  email: maria.merino@ehu.es
  organization: Dpto. de Matemática Aplicada, Estadística e Investigación Operativa, Universidad del País Vasco, Leioa, Vizcaya, Spain
– sequence: 4
  givenname: G.
  surname: Pérez
  fullname: Pérez, G.
  email: gloria.perez@ehu.es
  organization: Dpto. de Matemática Aplicada, Estadística e Investigación Operativa, Universidad del País Vasco, Leioa, Vizcaya, Spain
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=21330366$$DView record in Pascal Francis
BookMark eNp9kc9q3DAQh0VJoZttHqA3UWhvdmck27LpKYT-g0AuCeQmtPJoo8W2Ukmbtre-Q9-wT1KFXXrIIXOZy_fNDPM7ZSdLWIixNwg1AnYfdrUNsRYAfY1YA-ILtsJeyUp17e0JW4GEtoK26V-x05R2UEoJXLGbc76lhaKZuJm2Ifp8N3MXIk9hevDLlucfoUrZbImnHOydSdlbPvufNHL4-_sPcudjykfkPobNRHN6zV46MyU6O_Y1u_n86fria3V59eXbxfllZWXf5mocWucIbUtyVEqIxgG0g2lIKrBONBvRS3AtbFQHg-1AdaYfADdAzdihaeSavT_MLYu_7yllPftkaZrMQmGftJQCQZQ3rNnbJ-Au7ONSbtM4tL2UMAwFeneETLJmctEs1id9H_1s4i8tsGCy6wqHB87GkFIk9x9B0I9p6J0uaejHNDSiLmkURz1xrM8m-7DkaPz0rPnxYFJ55IOnqJP1tFgafSSb9Rj8M_Y_M82l5Q
CODEN CMORAP
CitedBy_id crossref_primary_10_1007_s11750_011_0237_1
crossref_primary_10_1007_s11750_009_0090_7
crossref_primary_10_1007_s11750_011_0240_6
crossref_primary_10_1007_s11750_011_0242_4
crossref_primary_10_1007_s11750_009_0083_6
crossref_primary_10_1016_j_apm_2012_01_037
crossref_primary_10_1007_s10479_014_1730_3
crossref_primary_10_1016_j_ejor_2010_11_022
crossref_primary_10_1016_j_cor_2009_06_023
crossref_primary_10_1016_j_seps_2019_100780
crossref_primary_10_1016_j_ejor_2015_08_059
crossref_primary_10_1007_s10479_018_3032_7
crossref_primary_10_1016_j_cor_2012_07_009
crossref_primary_10_1016_j_ejor_2015_01_004
crossref_primary_10_1007_s10479_015_1899_0
crossref_primary_10_1287_trsc_1120_0422
crossref_primary_10_1080_23311916_2017_1362803
crossref_primary_10_1016_j_cor_2015_09_005
crossref_primary_10_1016_j_cor_2014_03_010
crossref_primary_10_1016_j_jclepro_2017_02_123
crossref_primary_10_1016_j_ejor_2011_12_032
Cites_doi 10.1287/opre.48.1.91.12450
10.1007/BF02680570
10.1016/S0167-6377(98)00050-9
10.1007/s10107-004-0566-z
10.1007/s10107-005-0592-5
10.1007/s10898-004-5910-6
10.1023/A:1013827731218
10.1023/A:1023071216923
10.1007/s101070100263
10.1007/s10107-006-0724-6
10.1007/s10107-003-0475-6
10.1023/A:1018930113099
10.1007/s10107-003-0445-z
10.1287/opre.50.3.415.7751
10.1007/BF01386316
10.1137/0114008
10.1016/S0377-2217(02)00628-8
10.1287/moor.16.1.119
10.1137/0117061
10.1016/j.omega.2004.05.001
ContentType Journal Article
Copyright 2008 Elsevier Ltd
2009 INIST-CNRS
Copyright Pergamon Press Inc. Sep 2009
Copyright_xml – notice: 2008 Elsevier Ltd
– notice: 2009 INIST-CNRS
– notice: Copyright Pergamon Press Inc. Sep 2009
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cor.2008.11.011
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList
Computer and Information Systems Abstracts
Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
Applied Sciences
EISSN 1873-765X
0305-0548
EndPage 2600
ExternalDocumentID 1652582071
21330366
10_1016_j_cor_2008_11_011
S0305054808002256
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEFWE
AEHXG
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
AOUOD
APLSM
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UAO
UPT
VH1
WUQ
XFK
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
AFXIZ
AGCQF
AGRNS
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c385t-d95ffe1c5e3d77224f0059a4e370cf24b2830f50b7609c6076a8901b0e4d61a43
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000264631300009&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0305-0548
IngestDate Thu Oct 02 05:43:35 EDT 2025
Fri Jul 25 03:03:38 EDT 2025
Mon Jul 21 09:17:24 EDT 2025
Sat Nov 29 03:23:33 EST 2025
Tue Nov 18 22:33:33 EST 2025
Fri Feb 23 02:33:28 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 9
Keywords Twin node family
Two-stage stochastic integer programming
Branch-and-fix coordination
Splitting variables
Benders decomposition
Nonanticipativity constraints
Script
Partition method
Algorithmics
Cluster
Linear programming
Stochastic programming
Integer programming
Zero one programming
Deterministic model
Mixed problem
Large scale
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c385t-d95ffe1c5e3d77224f0059a4e370cf24b2830f50b7609c6076a8901b0e4d61a43
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 195833099
PQPubID 45870
PageCount 11
ParticipantIDs proquest_miscellaneous_33210287
proquest_journals_195833099
pascalfrancis_primary_21330366
crossref_primary_10_1016_j_cor_2008_11_011
crossref_citationtrail_10_1016_j_cor_2008_11_011
elsevier_sciencedirect_doi_10_1016_j_cor_2008_11_011
PublicationCentury 2000
PublicationDate 2009-09-01
PublicationDateYYYYMMDD 2009-09-01
PublicationDate_xml – month: 09
  year: 2009
  text: 2009-09-01
  day: 01
PublicationDecade 2000
PublicationPlace Kidlington
PublicationPlace_xml – name: Kidlington
– name: New York
PublicationTitle Computers & operations research
PublicationYear 2009
Publisher Elsevier Ltd
Elsevier
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Elsevier
– name: Pergamon Press Inc
References Klein Haneveld, van der Vlerk Kang (bib18) 1999; 85
Nowak M, Schultz R, Westphalen W. Optimization of simultaneous power production and trading by stochastic integer programming. Technical report, Stochastic programming e-print series
Wets (bib1) 1966; 14
Birge, Louveaux (bib23) 1997
Laporte, Louveaux (bib2) 2002; 50
Sen, Sherali (bib12) 2006; 105
Romisch, Schultz (bib20) 2001
Alonso-Ayuso, Escudero, Garín, Ortuño, Pérez (bib6) 2005; 33
Sherali, Zhu (bib13) 2006; 108
Takriti, Birge (bib16) 2000; 48
Carøe, Schultz (bib14) 1999; 24
Dolan, Moré (bib25) 2002; 91
Sherali, Fraticelli (bib9) 2002; 22
Ahmed, Tawarmalani, Sahinidis (bib7) 2004; 100
Van Slyke, Wets (bib24) 1969; 17
Benders (bib3) 1962; 4
Schultz (bib21) 2003; 97
.
Rockafellar, Wets (bib17) 1991; 16
Ntaimo, Sen (bib11) 2005; 32
Alonso-Ayuso, Escudero, Garín, Ortuño, Pérez (bib5) 2003; 26
Carøe, Tind (bib8) 1998; 83
Hemmecke, Schultz (bib15) 2001
2002.
Alonso-Ayuso, Escudero, Ortuño (bib4) 2003; 151
Escudero LF, Garín MA, Merino M, Pérez G. A multistage stochastic integer programming model and algorithm for incorporating logical constraints in assets and liabilities under uncertainty. Computational Management Science, 2007, in press, doi
Sen, Higle (bib10) 2005; 104
Sherali (10.1016/j.cor.2008.11.011_bib9) 2002; 22
Sen (10.1016/j.cor.2008.11.011_bib12) 2006; 105
Klein Haneveld (10.1016/j.cor.2008.11.011_bib18) 1999; 85
Benders (10.1016/j.cor.2008.11.011_bib3) 1962; 4
Carøe (10.1016/j.cor.2008.11.011_bib14) 1999; 24
Alonso-Ayuso (10.1016/j.cor.2008.11.011_bib6) 2005; 33
Wets (10.1016/j.cor.2008.11.011_bib1) 1966; 14
Ntaimo (10.1016/j.cor.2008.11.011_bib11) 2005; 32
Birge (10.1016/j.cor.2008.11.011_bib23) 1997
Takriti (10.1016/j.cor.2008.11.011_bib16) 2000; 48
Van Slyke (10.1016/j.cor.2008.11.011_bib24) 1969; 17
Sherali (10.1016/j.cor.2008.11.011_bib13) 2006; 108
Dolan (10.1016/j.cor.2008.11.011_bib25) 2002; 91
Alonso-Ayuso (10.1016/j.cor.2008.11.011_bib5) 2003; 26
Ahmed (10.1016/j.cor.2008.11.011_bib7) 2004; 100
Romisch (10.1016/j.cor.2008.11.011_bib20) 2001
Schultz (10.1016/j.cor.2008.11.011_bib21) 2003; 97
Alonso-Ayuso (10.1016/j.cor.2008.11.011_bib4) 2003; 151
10.1016/j.cor.2008.11.011_bib22
Laporte (10.1016/j.cor.2008.11.011_bib2) 2002; 50
Rockafellar (10.1016/j.cor.2008.11.011_bib17) 1991; 16
Carøe (10.1016/j.cor.2008.11.011_bib8) 1998; 83
10.1016/j.cor.2008.11.011_bib19
Hemmecke (10.1016/j.cor.2008.11.011_bib15) 2001
Sen (10.1016/j.cor.2008.11.011_bib10) 2005; 104
References_xml – volume: 14
  start-page: 89
  year: 1966
  end-page: 105
  ident: bib1
  article-title: Programming under uncertainty: the equivalent convex program
  publication-title: SIAM Journal on Applied Mathematics
– volume: 97
  start-page: 285
  year: 2003
  end-page: 309
  ident: bib21
  article-title: Stochastic programming with integer variables
  publication-title: Mathematical Programming Series B
– volume: 50
  start-page: 415
  year: 2002
  end-page: 423
  ident: bib2
  article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
  publication-title: Operations Research
– volume: 24
  start-page: 37
  year: 1999
  end-page: 45
  ident: bib14
  article-title: Dual decomposition in stochastic integer programming
  publication-title: Operations Research Letters
– reference: Escudero LF, Garín MA, Merino M, Pérez G. A multistage stochastic integer programming model and algorithm for incorporating logical constraints in assets and liabilities under uncertainty. Computational Management Science, 2007, in press, doi:
– volume: 105
  start-page: 203
  year: 2006
  end-page: 223
  ident: bib12
  article-title: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
  publication-title: Mathematical Programming Series A
– volume: 100
  start-page: 355
  year: 2004
  end-page: 377
  ident: bib7
  article-title: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
  publication-title: Mathematical Programming
– start-page: 581
  year: 2001
  end-page: 600
  ident: bib20
  article-title: Multi-stage stochastic integer programs: an introduction
  publication-title: Online optimization of large scale systems
– volume: 17
  start-page: 638
  year: 1969
  end-page: 663
  ident: bib24
  article-title: L-shaped linear programs with application to optimal control and stochastic programming
  publication-title: SIAM Journal on Applied Mathematics
– volume: 83
  start-page: 451
  year: 1998
  end-page: 464
  ident: bib8
  article-title: L-shaped decomposition of two-stage stochastic programs with integer recourse
  publication-title: Mathematical Programming
– volume: 33
  start-page: 307
  year: 2005
  end-page: 318
  ident: bib6
  article-title: On the product selection and plant dimensioning problem under uncertainty
  publication-title: Omega—International Journal of Management Science
– volume: 22
  start-page: 319
  year: 2002
  end-page: 342
  ident: bib9
  article-title: A modification of Benders’ decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse
  publication-title: Journal of Global Optimization
– volume: 104
  start-page: 1
  year: 2005
  end-page: 20
  ident: bib10
  article-title: The
  publication-title: Mathematical Programming
– volume: 32
  start-page: 385
  year: 2005
  end-page: 400
  ident: bib11
  article-title: The million variable ‘march’ for stochastic combinatorial optimization
  publication-title: Journal of Global Optimization
– volume: 151
  start-page: 503
  year: 2003
  end-page: 519
  ident: bib4
  article-title: BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0–1 programs
  publication-title: European Journal of Operational Research
– reference: , 2002.
– volume: 108
  start-page: 597
  year: 2006
  end-page: 611
  ident: bib13
  article-title: On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
  publication-title: Mathematical Programming Series B
– reference: Nowak M, Schultz R, Westphalen W. Optimization of simultaneous power production and trading by stochastic integer programming. Technical report, Stochastic programming e-print series
– volume: 26
  start-page: 97
  year: 2003
  end-page: 124
  ident: bib5
  article-title: An approach for strategic supply chain planning based on stochastic 0–1 programming
  publication-title: Journal of Global Optimization
– volume: 48
  start-page: 91
  year: 2000
  end-page: 98
  ident: bib16
  article-title: Lagrangean solution techniques and bounds for loosely coupled mixed-integer stochastic programs
  publication-title: Operations Research
– volume: 16
  start-page: 119
  year: 1991
  end-page: 147
  ident: bib17
  article-title: Scenario and policy aggregation in optimisation under uncertainty
  publication-title: Mathematics of Operations Research
– volume: 91
  start-page: 201
  year: 2002
  end-page: 213
  ident: bib25
  article-title: Benchmarking optimization software with performance profiles
  publication-title: Mathematical Programming Series A
– volume: 4
  start-page: 238
  year: 1962
  end-page: 252
  ident: bib3
  article-title: Partitioning procedures for solving mixed variables programming problems
  publication-title: Numerische Mathematik
– year: 1997
  ident: bib23
  article-title: Introduction to stochastic programming
– volume: 85
  start-page: 39
  year: 1999
  end-page: 57
  ident: bib18
  article-title: Stochastic integer programming: general models and algorithms
  publication-title: Annals of Operations Research
– start-page: 601
  year: 2001
  end-page: 622
  ident: bib15
  article-title: Decomposition methods for two-stage stochastic integer programs
  publication-title: Online optimization of large scale systems
– reference: .
– volume: 48
  start-page: 91
  year: 2000
  ident: 10.1016/j.cor.2008.11.011_bib16
  article-title: Lagrangean solution techniques and bounds for loosely coupled mixed-integer stochastic programs
  publication-title: Operations Research
  doi: 10.1287/opre.48.1.91.12450
– ident: 10.1016/j.cor.2008.11.011_bib22
– volume: 83
  start-page: 451
  year: 1998
  ident: 10.1016/j.cor.2008.11.011_bib8
  article-title: L-shaped decomposition of two-stage stochastic programs with integer recourse
  publication-title: Mathematical Programming
  doi: 10.1007/BF02680570
– volume: 24
  start-page: 37
  year: 1999
  ident: 10.1016/j.cor.2008.11.011_bib14
  article-title: Dual decomposition in stochastic integer programming
  publication-title: Operations Research Letters
  doi: 10.1016/S0167-6377(98)00050-9
– volume: 104
  start-page: 1
  year: 2005
  ident: 10.1016/j.cor.2008.11.011_bib10
  article-title: The c3 theorem and the d2 algorithm for large scale stochastic mixed-integer programming: set convexification
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-004-0566-z
– volume: 105
  start-page: 203
  year: 2006
  ident: 10.1016/j.cor.2008.11.011_bib12
  article-title: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
  publication-title: Mathematical Programming Series A
  doi: 10.1007/s10107-005-0592-5
– volume: 32
  start-page: 385
  year: 2005
  ident: 10.1016/j.cor.2008.11.011_bib11
  article-title: The million variable ‘march’ for stochastic combinatorial optimization
  publication-title: Journal of Global Optimization
  doi: 10.1007/s10898-004-5910-6
– volume: 22
  start-page: 319
  year: 2002
  ident: 10.1016/j.cor.2008.11.011_bib9
  article-title: A modification of Benders’ decomposition algorithm for discrete subproblems: an approach for stochastic programs with integer recourse
  publication-title: Journal of Global Optimization
  doi: 10.1023/A:1013827731218
– volume: 26
  start-page: 97
  year: 2003
  ident: 10.1016/j.cor.2008.11.011_bib5
  article-title: An approach for strategic supply chain planning based on stochastic 0–1 programming
  publication-title: Journal of Global Optimization
  doi: 10.1023/A:1023071216923
– volume: 91
  start-page: 201
  year: 2002
  ident: 10.1016/j.cor.2008.11.011_bib25
  article-title: Benchmarking optimization software with performance profiles
  publication-title: Mathematical Programming Series A
  doi: 10.1007/s101070100263
– volume: 108
  start-page: 597
  year: 2006
  ident: 10.1016/j.cor.2008.11.011_bib13
  article-title: On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables
  publication-title: Mathematical Programming Series B
  doi: 10.1007/s10107-006-0724-6
– year: 1997
  ident: 10.1016/j.cor.2008.11.011_bib23
– volume: 100
  start-page: 355
  year: 2004
  ident: 10.1016/j.cor.2008.11.011_bib7
  article-title: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
  publication-title: Mathematical Programming
  doi: 10.1007/s10107-003-0475-6
– volume: 85
  start-page: 39
  year: 1999
  ident: 10.1016/j.cor.2008.11.011_bib18
  article-title: Stochastic integer programming: general models and algorithms
  publication-title: Annals of Operations Research
  doi: 10.1023/A:1018930113099
– start-page: 581
  year: 2001
  ident: 10.1016/j.cor.2008.11.011_bib20
  article-title: Multi-stage stochastic integer programs: an introduction
– volume: 97
  start-page: 285
  year: 2003
  ident: 10.1016/j.cor.2008.11.011_bib21
  article-title: Stochastic programming with integer variables
  publication-title: Mathematical Programming Series B
  doi: 10.1007/s10107-003-0445-z
– volume: 50
  start-page: 415
  year: 2002
  ident: 10.1016/j.cor.2008.11.011_bib2
  article-title: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
  publication-title: Operations Research
  doi: 10.1287/opre.50.3.415.7751
– volume: 4
  start-page: 238
  year: 1962
  ident: 10.1016/j.cor.2008.11.011_bib3
  article-title: Partitioning procedures for solving mixed variables programming problems
  publication-title: Numerische Mathematik
  doi: 10.1007/BF01386316
– volume: 14
  start-page: 89
  year: 1966
  ident: 10.1016/j.cor.2008.11.011_bib1
  article-title: Programming under uncertainty: the equivalent convex program
  publication-title: SIAM Journal on Applied Mathematics
  doi: 10.1137/0114008
– ident: 10.1016/j.cor.2008.11.011_bib19
– volume: 151
  start-page: 503
  year: 2003
  ident: 10.1016/j.cor.2008.11.011_bib4
  article-title: BFC, a branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0–1 programs
  publication-title: European Journal of Operational Research
  doi: 10.1016/S0377-2217(02)00628-8
– volume: 16
  start-page: 119
  year: 1991
  ident: 10.1016/j.cor.2008.11.011_bib17
  article-title: Scenario and policy aggregation in optimisation under uncertainty
  publication-title: Mathematics of Operations Research
  doi: 10.1287/moor.16.1.119
– start-page: 601
  year: 2001
  ident: 10.1016/j.cor.2008.11.011_bib15
  article-title: Decomposition methods for two-stage stochastic integer programs
– volume: 17
  start-page: 638
  year: 1969
  ident: 10.1016/j.cor.2008.11.011_bib24
  article-title: L-shaped linear programs with application to optimal control and stochastic programming
  publication-title: SIAM Journal on Applied Mathematics
  doi: 10.1137/0117061
– volume: 33
  start-page: 307
  year: 2005
  ident: 10.1016/j.cor.2008.11.011_bib6
  article-title: On the product selection and plant dimensioning problem under uncertainty
  publication-title: Omega—International Journal of Management Science
  doi: 10.1016/j.omega.2004.05.001
SSID ssj0000721
Score 2.054585
Snippet We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0–1 first stage variables. The constraints in the first...
We present an algorithmic approach for solving large-scale two-stage stochastic problems having mixed 0-1 first stage variables. The constraints in the first...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 2590
SubjectTerms Algorithms
Applied sciences
Benders decomposition
Branch-and-fix coordination
Exact sciences and technology
Integer programming
Mathematical programming
Nonanticipativity constraints
Operational research and scientific management
Operational research. Management science
Problem solving
Splitting variables
Stochastic models
Studies
Twin node family
Two-stage stochastic integer programming
Title A general algorithm for solving two-stage stochastic mixed 0–1 first-stage problems
URI https://dx.doi.org/10.1016/j.cor.2008.11.011
https://www.proquest.com/docview/195833099
https://www.proquest.com/docview/33210287
Volume 36
WOSCitedRecordID wos000264631300009&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: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1bb9MwFLagQwiEuHQgymD4gb1QRXJjJ04eK2gHqJRJdFLfoti1t05bUpoW-vM5jp2k5TLggZeoyqVW-305Pj4-5zsIvSKKiEBK5YVqlnqMM-WJSGjPZ1zxWFCf6FLEdcTH42g6jU9cTLco2wnwLIs2m3jxX6GGcwC2KZ39B7jrL4UT8BlAhyPADse_Ar5vuiKbSFM3vTzLYe1_flXmEsKoZfBg9S33wCU8M9KyuTxPjVBz92q-Ac-TeL2unoM_6G5w3WaKbQ-2agNRlKTJF2rpkumcbFAdXh4Ucj1Ttoxm1CQQH8Pi3OYPN2HUj6YGMd-JzZ6opY1tH-_EJZrEq7oey6QFBlZHs7K1VuzEcSreNpyB7RrqJmEjm_9LA29jDReAz9ImwhoJVmeud8S0x5-S4elolEwG08kRHS6-eKbTmNmRP6JvLeo30Z7Pgzhqob3--8H0QzOD87Jer_4F1W54mRf4w8i_82fuLdIC3jJt26P8NNOX7svkIbrv1h24b_nyCN1QWRvdrsoe2uhBhSt21r6N7m5pVe6jz33seIVrXmHgFXa8wjWvcMMrXPIKA6_wFq9wxavH6HQ4mLx557mOHJ6kUbDyZnGgterJQNEZLMt8pk3xcsoU5URqnwkjJ6cDInhIYhkSHqYROJyCKDYLeymjT1AryzP1FGER-lpoqUVAA0YjmDf8HiHCV5JJCWuQDiLV_5pIJ1dvuqZcJlVe4kUCUNg2qrCIBSg66HX9yMJqtVx3M6vASpyzaZ3IBKh23WOHO8DWA_k9arzBsIMOKqQTZxWKxCg6weU47qCX9VWw42ZzLs1Uvi4Saorp_Ig_--MdB-hO8749R63Vcq1eoFvy62peLA8dl78DWzG8wA
linkProvider Elsevier
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+general+algorithm+for+solving+two-stage+stochastic+mixed+0-1+first-stage+problems&rft.jtitle=Computers+%26+operations+research&rft.au=Escudero%2C+L+F&rft.au=Garin%2C+M+A&rft.au=Merino%2C+M&rft.au=Perez%2C+G&rft.date=2009-09-01&rft.issn=0305-0548&rft.volume=36&rft.issue=9&rft.spage=2590&rft.epage=2600&rft_id=info:doi/10.1016%2Fj.cor.2008.11.011&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon