Cutting plane method for multiple objective stochastic integer linear programming

This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After representing uncertain aspirations of the decision maker by converting the original problem into a deterministic multiple objective integer line...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 168; no. 3; pp. 967 - 984
Main Authors: Abbas, Moncef, Bellahcene, Fatima
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 01.02.2006
Elsevier
Elsevier Sequoia S.A
Series:European Journal of Operational Research
Subjects:
L-shaped decomposition method
Linear programming
Multiple objective integer programming
Operations research
Stochastic models
Stochastic programming by recourse
Studies
L-shaped decomposition method
Multiple objective integer programming
Stochastic programming by recourse
ISSN:0377-2217, 1872-6860
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After representing uncertain aspirations of the decision maker by converting the original problem into a deterministic multiple objective integer linear program (MOILP), a cutting plane technique may be used to compute all the efficient solutions of the last model leaving the decision maker to choose a solution according to his preferences. A numerical example is also included for illustration.
AbstractList This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After representing uncertain aspirations of the decision maker by converting the original problem into a deterministic multiple objective integer linear program (MOILP), a cutting plane technique may be used to compute all the efficient solutions of the last model leaving the decision maker to choose a solution according to his preferences. A numerical example is also included for illustration. [PUBLICATION ABSTRACT]
This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After representing uncertain aspirations of the decision maker by converting the original problem into a deterministic multiple objective integer linear program (MOILP), a cutting plane technique may be used to compute all the efficient solutions of the last model leaving the decision maker to choose a solution according to his preferences. A numerical example is also included for illustration.
Author Bellahcene, Fatima
Abbas, Moncef
Author_xml – sequence: 1
  givenname: Moncef
  surname: Abbas
  fullname: Abbas, Moncef
  email: moncef_abbas@yahoo.com
  organization: USTHB, Faculté de Mathématiques, LAID3, B.P. 32, Bab-Ezzouar 16111, Alger, Algeria
– sequence: 2
  givenname: Fatima
  surname: Bellahcene
  fullname: Bellahcene, Fatima
  organization: Faculté des Sciences, Département de Mathématiques, Université Mouloud Mammeri, 15000 Tizi-Ouzou, Algeria
BackLink http://econpapers.repec.org/article/eeeejores/v_3a168_3ay_3a2006_3ai_3a3_3ap_3a967-984.htm$$DView record in RePEc
BookMark eNp9kUGLFDEQhYOs4OzqH_DUeO82lWTTafAig67iggh6Dul09Uya7k6bZAb231vDiAcPW_CqLvW-gle37GaNKzL2FngDHPT7qcEppkZwLhqAhnP9gu3AtKLWRvMbtuOybWshoH3FbnOeOOdwD_c79mN_KiWsh2qb3YrVguUYh2qMqVpOcwnbjFXsJ_QlnLHKJfqjyyX4KqwFD5iqOazoUrWleEhuWYj0mr0c3Zzxzd95x359_vRz_6V-_P7wdf_xsfZKdaX2Q-_U2HfQC1QwSnDCSQmKSw9t62AEM1IbWu2FaWU3-M4Jo3tQg1EgRnnH3l25dPv3CXOxUzyllU5awRVIw7WkpW_XpYQberulsLj0ZJGK8sJsz1Y60Ib6E4ny0zQCSZI2Uqdb2xllj2UhmrjSfIo5Jxz_AYHbyx_sZC9ce_mDBbCEI5P5z-RDcSXEtSQX5uetH65WpBzPAZPNPuDqcQiJXmKHGJ6z_wE7PKYI
CODEN EJORDT
CitedBy_id crossref_primary_10_1007_s11340_007_9081_5
crossref_primary_10_1016_j_amc_2006_10_020
crossref_primary_10_3390_app8091454
crossref_primary_10_1016_j_ejor_2009_03_020
crossref_primary_10_1177_097324701000600301
crossref_primary_10_3233_JIFS_191453
crossref_primary_10_1108_AEAT_09_2016_0145
crossref_primary_10_1016_j_compstruc_2008_02_009
crossref_primary_10_1007_s11771_018_3811_y
crossref_primary_10_1016_j_amc_2007_03_037
crossref_primary_10_1007_s10287_012_0155_1
crossref_primary_10_1016_j_cma_2008_04_027
crossref_primary_10_1007_s12351_019_00493_1
crossref_primary_10_1007_s10479_013_1369_5
Cites_doi 10.1016/S0167-5060(08)70760-X
10.1016/0377-2217(86)90160-8
10.1002/mcda.4020030204
10.1016/0377-2217(82)90182-5
10.1007/978-94-009-2111-5_8
10.1002/9781118627372
10.1287/mnsc.1.3-4.197
10.1007/BF01386316
ContentType Journal Article
Copyright 2004 Elsevier B.V.
Copyright Elsevier Sequoia S.A. Feb 1, 2006
Copyright_xml – notice: 2004 Elsevier B.V.
– notice: Copyright Elsevier Sequoia S.A. Feb 1, 2006
DBID AAYXX
CITATION
DKI
X2L
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1016/j.ejor.2002.11.006
DatabaseName CrossRef
RePEc IDEAS
RePEc
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering 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
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1872-6860
EndPage 984
ExternalDocumentID 899250841
eeeejores_v_3a168_3ay_3a2006_3ai_3a3_3ap_3a967_984_htm
10_1016_j_ejor_2002_11_006
S0377221704003431
Genre Feature
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1OL
1RT
1~.
1~5
29G
4.4
41~
457
4G.
5GY
5VS
6OB
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABFNM
ABFRF
ABJNI
ABMAC
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACIWK
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADIYS
ADJOM
ADMUD
AEBSH
AEFWE
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
Q38
R2-
RIG
ROL
RPZ
RXW
SCC
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
VH1
WUQ
XPP
ZMT
~02
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADXHL
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
02
08R
0R
1
41
6XO
8P
AAPBV
ABFLS
ADALY
DKI
G-
HZ
IPNFZ
K
M
MS
PQEST
STF
X
X2L
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c449t-cdba4fb91b2e41f31a2a331403c177a1f18f1f1d76c28739dc9a286b14d8412f3
ISICitedReferencesCount 21
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000232383200020&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0377-2217
IngestDate Sun Nov 09 06:20:28 EST 2025
Wed Aug 18 03:50:57 EDT 2021
Tue Nov 18 20:44:32 EST 2025
Sat Nov 29 01:40:42 EST 2025
Fri Feb 23 02:32:18 EST 2024
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords L-shaped decomposition method
Multiple objective integer programming
Stochastic programming by recourse
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c449t-cdba4fb91b2e41f31a2a331403c177a1f18f1f1d76c28739dc9a286b14d8412f3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
PQID 204138063
PQPubID 45678
PageCount 18
ParticipantIDs proquest_journals_204138063
repec_primary_eeeejores_v_3a168_3ay_3a2006_3ai_3a3_3ap_3a967_984_htm
crossref_primary_10_1016_j_ejor_2002_11_006
crossref_citationtrail_10_1016_j_ejor_2002_11_006
elsevier_sciencedirect_doi_10_1016_j_ejor_2002_11_006
PublicationCentury 2000
PublicationDate 2006-02-01
PublicationDateYYYYMMDD 2006-02-01
PublicationDate_xml – month: 02
  year: 2006
  text: 2006-02-01
  day: 01
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationSeriesTitle European Journal of Operational Research
PublicationTitle European journal of operational research
PublicationYear 2006
Publisher Elsevier B.V
Elsevier
Elsevier Sequoia S.A
Publisher_xml – name: Elsevier B.V
– name: Elsevier
– name: Elsevier Sequoia S.A
References Abbas, Moulai (bib1) 1999; 29
P. Kall, S.W. Wallace, Stochastic Programming. Willey Interscience Series in Systems and Optimization, 1994.
Teghem (bib12) 1990
A. Goicoechea, L. Dukstein, R.L. Bulfin, Multiobjective stochastic programming the PROTRADE-method. Operation Research Society of America, 1976.
Zionts (bib16) 1977; 1
G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimisation, 1988.
B. Urli, R. Nadeau, Multiobjective stochastic linear programming with incomplete information: A general methodology, In: R. Slowinski, J. Teghem (Eds.), 1990, pp. 131–161.
Benders (bib2) 1962; 4
Klein, Hannon (bib8) 1982; 9
Dantzig (bib3) 1955; 1
Teghem, Dufrane, Thauvoye, Kunsch (bib11) 1986; 26
Gupta, Malhotra (bib5) 1992; 34
Teghem, Kunsch (bib10) 1986
Teghem, Kunsch (bib13) 1986; 3
Kall (bib6) 1976
Teghem, Ulungu (bib14) 1994; 3
10.1016/j.ejor.2002.11.006_bib4
Gupta (10.1016/j.ejor.2002.11.006_bib5) 1992; 34
Teghem (10.1016/j.ejor.2002.11.006_bib11) 1986; 26
10.1016/j.ejor.2002.11.006_bib7
10.1016/j.ejor.2002.11.006_bib9
Dantzig (10.1016/j.ejor.2002.11.006_bib3) 1955; 1
10.1016/j.ejor.2002.11.006_bib15
Abbas (10.1016/j.ejor.2002.11.006_bib1) 1999; 29
Kall (10.1016/j.ejor.2002.11.006_bib6) 1976
Teghem (10.1016/j.ejor.2002.11.006_bib14) 1994; 3
Teghem (10.1016/j.ejor.2002.11.006_bib12) 1990
Klein (10.1016/j.ejor.2002.11.006_bib8) 1982; 9
Benders (10.1016/j.ejor.2002.11.006_bib2) 1962; 4
Teghem (10.1016/j.ejor.2002.11.006_bib10) 1986
Teghem (10.1016/j.ejor.2002.11.006_bib13) 1986; 3
Zionts (10.1016/j.ejor.2002.11.006_bib16) 1977; 1
References_xml – volume: 29
  start-page: 15
  year: 1999
  end-page: 38
  ident: bib1
  article-title: Solving multiple objective integer linear programming
  publication-title: Ricerca Operativa
– volume: 9
  start-page: 378
  year: 1982
  end-page: 385
  ident: bib8
  article-title: An algorithm for the multiple objective integer linear programming problem
  publication-title: European Journal of Operational Research
– volume: 3
  start-page: 95
  year: 1986
  end-page: 108
  ident: bib13
  article-title: A survey of techniques for finding efficient solutions for multiobjective iinteger linear programming
  publication-title: Asia-Pacific Journal of Operations Research
– volume: 34
  start-page: 51
  year: 1992
  end-page: 68
  ident: bib5
  article-title: Multi-criteria integer linear programming problem
  publication-title: Cahiers de CERO
– reference: A. Goicoechea, L. Dukstein, R.L. Bulfin, Multiobjective stochastic programming the PROTRADE-method. Operation Research Society of America, 1976.
– year: 1976
  ident: bib6
  article-title: Stochastic Linear Programming
– volume: 26
  start-page: 65
  year: 1986
  end-page: 82
  ident: bib11
  article-title: STRANGE: Interactive method for multiobjective linear programming under uncertainty
  publication-title: European Journal of Operational Research
– volume: 1
  start-page: 197
  year: 1955
  end-page: 206
  ident: bib3
  article-title: Linear programming under uncertainty
  publication-title: Management Science
– reference: P. Kall, S.W. Wallace, Stochastic Programming. Willey Interscience Series in Systems and Optimization, 1994.
– volume: 3
  start-page: 83
  year: 1994
  end-page: 104
  ident: bib14
  article-title: Multiobjective combinatorial optimization problems: A survey
  publication-title: Journal of Multicriteria Decision Analysis
– volume: 4
  start-page: 238
  year: 1962
  end-page: 252
  ident: bib2
  article-title: Partitioning procedures for solving mixed-variables programming problems
  publication-title: Numerische Mathematik
– reference: G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimisation, 1988.
– start-page: 101
  year: 1990
  end-page: 115
  ident: bib12
  article-title: Strange-Momix: An interactive method for mixed integer linear programming
  publication-title: Stochastic Versus Fuzzy Apprroaches to Multiobjective Mathematical Programming Under Uncertainty
– reference: B. Urli, R. Nadeau, Multiobjective stochastic linear programming with incomplete information: A general methodology, In: R. Slowinski, J. Teghem (Eds.), 1990, pp. 131–161.
– start-page: 75
  year: 1986
  end-page: 87
  ident: bib10
  article-title: Interactive method for multiobjective integer linear programming
  publication-title: Large Scale Modelling and Interactive Decision Analysis
– volume: 1
  start-page: 551
  year: 1977
  end-page: 562
  ident: bib16
  article-title: Integer programming with multiple objectives
  publication-title: Annals of Discrete Mathematics
– ident: 10.1016/j.ejor.2002.11.006_bib4
– volume: 1
  start-page: 551
  year: 1977
  ident: 10.1016/j.ejor.2002.11.006_bib16
  article-title: Integer programming with multiple objectives
  publication-title: Annals of Discrete Mathematics
  doi: 10.1016/S0167-5060(08)70760-X
– volume: 26
  start-page: 65
  issue: 1
  year: 1986
  ident: 10.1016/j.ejor.2002.11.006_bib11
  article-title: STRANGE: Interactive method for multiobjective linear programming under uncertainty
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(86)90160-8
– year: 1976
  ident: 10.1016/j.ejor.2002.11.006_bib6
– volume: 3
  start-page: 83
  year: 1994
  ident: 10.1016/j.ejor.2002.11.006_bib14
  article-title: Multiobjective combinatorial optimization problems: A survey
  publication-title: Journal of Multicriteria Decision Analysis
  doi: 10.1002/mcda.4020030204
– ident: 10.1016/j.ejor.2002.11.006_bib7
– volume: 9
  start-page: 378
  year: 1982
  ident: 10.1016/j.ejor.2002.11.006_bib8
  article-title: An algorithm for the multiple objective integer linear programming problem
  publication-title: European Journal of Operational Research
  doi: 10.1016/0377-2217(82)90182-5
– start-page: 101
  year: 1990
  ident: 10.1016/j.ejor.2002.11.006_bib12
  article-title: Strange-Momix: An interactive method for mixed integer linear programming
– start-page: 75
  year: 1986
  ident: 10.1016/j.ejor.2002.11.006_bib10
  article-title: Interactive method for multiobjective integer linear programming
– ident: 10.1016/j.ejor.2002.11.006_bib15
  doi: 10.1007/978-94-009-2111-5_8
– ident: 10.1016/j.ejor.2002.11.006_bib9
  doi: 10.1002/9781118627372
– volume: 29
  start-page: 15
  issue: 89
  year: 1999
  ident: 10.1016/j.ejor.2002.11.006_bib1
  article-title: Solving multiple objective integer linear programming
  publication-title: Ricerca Operativa
– volume: 3
  start-page: 95
  year: 1986
  ident: 10.1016/j.ejor.2002.11.006_bib13
  article-title: A survey of techniques for finding efficient solutions for multiobjective iinteger linear programming
  publication-title: Asia-Pacific Journal of Operations Research
– volume: 1
  start-page: 197
  year: 1955
  ident: 10.1016/j.ejor.2002.11.006_bib3
  article-title: Linear programming under uncertainty
  publication-title: Management Science
  doi: 10.1287/mnsc.1.3-4.197
– volume: 4
  start-page: 238
  year: 1962
  ident: 10.1016/j.ejor.2002.11.006_bib2
  article-title: Partitioning procedures for solving mixed-variables programming problems
  publication-title: Numerische Mathematik
  doi: 10.1007/BF01386316
– volume: 34
  start-page: 51
  year: 1992
  ident: 10.1016/j.ejor.2002.11.006_bib5
  article-title: Multi-criteria integer linear programming problem
  publication-title: Cahiers de CERO
SSID ssj0001515
Score 1.9692789
Snippet This paper grapples with the problem of incorporating integer variables in the constraints of a multiple objective stochastic linear program (MOSLP). After...
SourceID proquest
repec
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 967
SubjectTerms L-shaped decomposition method
Linear programming
Multiple objective integer programming
Operations research
Stochastic models
Stochastic programming by recourse
Studies
Title Cutting plane method for multiple objective stochastic integer linear programming
URI https://dx.doi.org/10.1016/j.ejor.2002.11.006
http://econpapers.repec.org/article/eeeejores/v_3a168_3ay_3a2006_3ai_3a3_3ap_3a967-984.htm
https://www.proquest.com/docview/204138063
Volume 168
WOSCitedRecordID wos000232383200020&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: 1872-6860
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001515
  issn: 0377-2217
  databaseCode: AIEXJ
  dateStart: 19950105
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKihA88FGGKAPkB8RLlapx3MZ-rEYnQKWA1qG-WY5jq622NuuXxl_Cv8s5drIMRgUPVLJbOXWa5n53vnPuA6E3UWqz2IUy4FT1AmoMsBQAJwBVH5Y3qiXN9zu-DePRiE0m_Eut9qOIhdmdx4sFu7ri2X8lNYwBsW3o7D-QuzwpDMBnIDr0QHbo_4rwx1vnypxZN1ZfITp3Jix9B5fJ3Im5Fmh-aiptqmaXN0KvWlbttOmvnd_WRbGy3bZ57xVZGFgVW4o-d1C5x9xPEhcx9smGR5rS-Lc-V1OlvXMxzPbLQ2X_4YYvRxkYc6ovt8uZbJ22-xUZBkgICHHhmW3tZCyLSdBjroxAKYR7rIK2qCJSuSvX8Zuod7sO87aeL_O8rqRts7F2bsmrPfosTs6GQzEeTMY3j-brOFicoAcyGr7NLgNbjsw-tve1We6gOom7HMRlvf9hMPlYLvJWD8wfUPn_5-OxnOvgr5f0J52nYtPUVzrTqqLajB-jh94mwX2HpSeophcNdK8IiWigR0XpD-xXggZ6UMlj-RR99ZjDOeawwxwGzOECc7jEHL7GHPaYww5zuIK5Q3R2Mhgfvw98rY5AUco3gUoTSU3Cw4RoGpoolERGkU0GqcI4lqEJmYEujXsKbPSIp4pLwnpJSFO488REz9DBYrnQzxFmxLAoZVxq0D2NNLKTEqUT2uFGd7lWTRQWd1Mon8je1lM5F4XH4lxYCtgKqwQsXAEUaKJWOSdzaVz2frtbEEl4RdQpmALAt3feUUFR4dlwDcdBT2RgCTTRu5zI5QVoeMEZ9FrsRCSBA6D_Ds1yGbzNoEXQMmjABIIzKqabixd7f-QI3b9m0pfoYLPa6lfortptZuvVa4_in54Mylk
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=Cutting+plane+method+for+multiple+objective+stochastic+integer+linear+programming&rft.jtitle=European+journal+of+operational+research&rft.au=Abbas%2C+Moncef&rft.au=Bellahcene%2C+Fatima&rft.date=2006-02-01&rft.pub=Elsevier+Sequoia+S.A&rft.issn=0377-2217&rft.eissn=1872-6860&rft.volume=168&rft.issue=3&rft.spage=967&rft_id=info:doi/10.1016%2Fj.ejor.2002.11.006&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=899250841
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0377-2217&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0377-2217&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0377-2217&client=summon