File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A conic integer programming approach to stochastic joint location-inventory problems

TitleA conic integer programming approach to stochastic joint location-inventory problems
Authors
KeywordsIntegrated supply chain
Covers
Polymatroids
Risk pooling
Conic mixed-integer program
Issue Date2012
Citation
Operations Research, 2012, v. 60, n. 2, p. 366-381 How to Cite?
AbstractWe study several joint facility location and inventory management problems with stochastic retailer demand. In particular, we consider cases with uncapacitated facilities, capacitated facilities, correlated retailer demand, stochastic lead times, and multicommodities. We show how to formulate these problems as conic quadratic mixed-integer problems. Valid inequalities, including extended polymatroid and extended cover cuts, are added to strengthen the formulations and improve the computational results. Compared to the existing modeling and solution methods, the new conic integer programming approach not only provides a more general modeling framework but also leads to fast solution times in general. © 2012 INFORMS.
Persistent Identifierhttp://hdl.handle.net/10722/296248
ISSN
2021 Impact Factor: 3.924
2020 SCImago Journal Rankings: 3.797
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorAtamtürk, Alper-
dc.contributor.authorBerenguer, Gemma-
dc.contributor.authorShen, Zuo Jun Max-
dc.date.accessioned2021-02-11T04:53:09Z-
dc.date.available2021-02-11T04:53:09Z-
dc.date.issued2012-
dc.identifier.citationOperations Research, 2012, v. 60, n. 2, p. 366-381-
dc.identifier.issn0030-364X-
dc.identifier.urihttp://hdl.handle.net/10722/296248-
dc.description.abstractWe study several joint facility location and inventory management problems with stochastic retailer demand. In particular, we consider cases with uncapacitated facilities, capacitated facilities, correlated retailer demand, stochastic lead times, and multicommodities. We show how to formulate these problems as conic quadratic mixed-integer problems. Valid inequalities, including extended polymatroid and extended cover cuts, are added to strengthen the formulations and improve the computational results. Compared to the existing modeling and solution methods, the new conic integer programming approach not only provides a more general modeling framework but also leads to fast solution times in general. © 2012 INFORMS.-
dc.languageeng-
dc.relation.ispartofOperations Research-
dc.subjectIntegrated supply chain-
dc.subjectCovers-
dc.subjectPolymatroids-
dc.subjectRisk pooling-
dc.subjectConic mixed-integer program-
dc.titleA conic integer programming approach to stochastic joint location-inventory problems-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1287/opre.1110.1037-
dc.identifier.scopuseid_2-s2.0-84861602824-
dc.identifier.volume60-
dc.identifier.issue2-
dc.identifier.spage366-
dc.identifier.epage381-
dc.identifier.eissn1526-5463-
dc.identifier.isiWOS:000304225100009-
dc.identifier.issnl0030-364X-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats