File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Inventory placement in acyclic supply chain networks

TitleInventory placement in acyclic supply chain networks
Authors
KeywordsSafety stock placement
Cutting plane
Piecewise linear approximation
Integer programming
Issue Date2006
Citation
Operations Research Letters, 2006, v. 34, n. 2, p. 228-238 How to Cite?
AbstractBy adding a set of redundant constraints, and by iteratively refining the approximation, we show that a commercial solver is able to routinely solve moderate-size strategic safety stock placement problems to optimality. The speed-up arises because the solver automatically generates strong flow cover cuts using the redundant constraints. © 2005 Elsevier B.V. All rights reserved.
Persistent Identifierhttp://hdl.handle.net/10722/296031
ISSN
2023 Impact Factor: 0.8
2023 SCImago Journal Rankings: 0.449
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorMagnanti, Thomas L.-
dc.contributor.authorShen, Zuo Jun Max-
dc.contributor.authorShu, Jia-
dc.contributor.authorSimchi-Levi, David-
dc.contributor.authorTeo, Chung Piaw-
dc.date.accessioned2021-02-11T04:52:41Z-
dc.date.available2021-02-11T04:52:41Z-
dc.date.issued2006-
dc.identifier.citationOperations Research Letters, 2006, v. 34, n. 2, p. 228-238-
dc.identifier.issn0167-6377-
dc.identifier.urihttp://hdl.handle.net/10722/296031-
dc.description.abstractBy adding a set of redundant constraints, and by iteratively refining the approximation, we show that a commercial solver is able to routinely solve moderate-size strategic safety stock placement problems to optimality. The speed-up arises because the solver automatically generates strong flow cover cuts using the redundant constraints. © 2005 Elsevier B.V. All rights reserved.-
dc.languageeng-
dc.relation.ispartofOperations Research Letters-
dc.subjectSafety stock placement-
dc.subjectCutting plane-
dc.subjectPiecewise linear approximation-
dc.subjectInteger programming-
dc.titleInventory placement in acyclic supply chain networks-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/j.orl.2005.04.004-
dc.identifier.scopuseid_2-s2.0-29144527111-
dc.identifier.volume34-
dc.identifier.issue2-
dc.identifier.spage228-
dc.identifier.epage238-
dc.identifier.isiWOS:000234783800015-
dc.identifier.issnl0167-6377-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats