File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.orl.2005.04.004
- Scopus: eid_2-s2.0-29144527111
- WOS: WOS:000234783800015
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Inventory placement in acyclic supply chain networks
Title | Inventory placement in acyclic supply chain networks |
---|---|
Authors | |
Keywords | Safety stock placement Cutting plane Piecewise linear approximation Integer programming |
Issue Date | 2006 |
Citation | Operations Research Letters, 2006, v. 34, n. 2, p. 228-238 How to Cite? |
Abstract | By 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 Identifier | http://hdl.handle.net/10722/296031 |
ISSN | 2023 Impact Factor: 0.8 2023 SCImago Journal Rankings: 0.449 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Magnanti, Thomas L. | - |
dc.contributor.author | Shen, Zuo Jun Max | - |
dc.contributor.author | Shu, Jia | - |
dc.contributor.author | Simchi-Levi, David | - |
dc.contributor.author | Teo, Chung Piaw | - |
dc.date.accessioned | 2021-02-11T04:52:41Z | - |
dc.date.available | 2021-02-11T04:52:41Z | - |
dc.date.issued | 2006 | - |
dc.identifier.citation | Operations Research Letters, 2006, v. 34, n. 2, p. 228-238 | - |
dc.identifier.issn | 0167-6377 | - |
dc.identifier.uri | http://hdl.handle.net/10722/296031 | - |
dc.description.abstract | By 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.language | eng | - |
dc.relation.ispartof | Operations Research Letters | - |
dc.subject | Safety stock placement | - |
dc.subject | Cutting plane | - |
dc.subject | Piecewise linear approximation | - |
dc.subject | Integer programming | - |
dc.title | Inventory placement in acyclic supply chain networks | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1016/j.orl.2005.04.004 | - |
dc.identifier.scopus | eid_2-s2.0-29144527111 | - |
dc.identifier.volume | 34 | - |
dc.identifier.issue | 2 | - |
dc.identifier.spage | 228 | - |
dc.identifier.epage | 238 | - |
dc.identifier.isi | WOS:000234783800015 | - |
dc.identifier.issnl | 0167-6377 | - |