{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:18:18Z","timestamp":1773717498245,"version":"3.50.1"},"reference-count":100,"publisher":"Elsevier","isbn-type":[{"value":"9780444513281","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1016\/s0927-0507(03)11002-x","type":"book-chapter","created":{"date-parts":[[2005,4,18]],"date-time":"2005-04-18T19:58:53Z","timestamp":1113854333000},"page":"15-93","source":"Crossref","is-referenced-by-count":22,"title":["Supply Chain Design and Planning \u2013 Applications of Optimization Techniques for Strategic and Tactical Models"],"prefix":"10.1016","author":[{"given":"Ana","family":"Muriel","sequence":"first","affiliation":[]},{"given":"David","family":"Simchi-Levi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0927-0507(03)11002-X_BIB1","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1287\/opre.41.3.549","article-title":"Improved algorithms for economic lot-size problems","volume":"41","author":"Aggarwal","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB2","unstructured":"Agrawal, V., A. Kambil (2000). Dynamic Pricing Strategies in Electronic Commerce, Working paper. Stern Business School, New York University"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB3","unstructured":"Ahuja, R. K., T. L., Magnanti, J. B. Orlin (1993). Network Flows: Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, New Jersey"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB4","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1057\/palgrave.jors.2600363","article-title":"New formulation and relaxation to solve a concave-cost network flow problem","volume":"48","author":"Amiry","year":"1997","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB5","series-title":"Vehicle Routing and the Supply Chain. Quantitative Models for Supply Chain Management","first-page":"147","author":"Anily","year":"1998"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0167-6377(89)90001-1","article-title":"Computational complexity of uncapacitated multi-echelon production planning problems","volume":"8","author":"Arkin","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB7","first-page":"485","article-title":"Improved low-degree testing and its applications","author":"Arora","year":"1997","journal-title":"Proceedings of the 29th Annual ACM Symposium on the Theory of Computing"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB8","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/net.3230190202","article-title":"A composite algorithm for a concave-cost network flow problem","volume":"19","author":"Balakrishnan","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB9","series-title":"Annotated Bibliographies in Combinatorial Optimization","first-page":"311","article-title":"Network design","author":"Balakrishnan","year":"1997"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF02071976","article-title":"Models for planning capacity expansion in local access telecommunication networks","volume":"33","author":"Balakrishnan","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB11","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/0377-2217(84)90211-X","article-title":"A heuristic lagrangian algorithm for the capacitated plant location problem","volume":"15","author":"Barcelo","year":"1984","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB12","doi-asserted-by":"crossref","unstructured":"Belobaba, P.P. (1987). Airline yield management: An overview of seat inventory control. Transportation Science 21, 63\u201373","DOI":"10.1287\/trsc.21.2.63"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB13","unstructured":"Bertsekas, D. (1995). Dynamic Programming and Optimal Control, Volume One, Athena Scientific"},{"issue":"3-1","key":"10.1016\/S0927-0507(03)11002-X_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF01581104","article-title":"Minimum cost capacity installation for multi-commodity network flows","volume":"81","author":"Bienstock","year":"1998","journal-title":"Mathematical Programming Series B"},{"issue":"1","key":"10.1016\/S0927-0507(03)11002-X_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1287\/inte.22.1.147","article-title":"Interactive optimization improves service and performance for yellow freight system","volume":"22","author":"Braklow","year":"1992","journal-title":"Interfaces"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB16","doi-asserted-by":"crossref","unstructured":"Bramel, J., D. Simchi-Levi (1997). The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management. Springer Series in Operations Research, Springer-Verlag, New York","DOI":"10.1007\/978-1-4684-9309-2"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB17","unstructured":"Caplice, C.G. (1996). An Optimization Based Bidding Process: A New Framework for Shipper\u2013Carrier Relationships. Ph.D. Thesis, Massachusetts Institute of Technology"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB18","unstructured":"Chan, L.M.A., A. Muriel, D. Simchi-Levi (1999). Production\/Distribution Planning Problems with Piece-Wise Linear and Concave Cost Structures. Northwestern University"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB19","doi-asserted-by":"crossref","first-page":"1058","DOI":"10.1287\/opre.50.6.1058.350","article-title":"An approximation algorithm for the economic lot sizing model with piece-wise linear cost structures","volume":"50","author":"Chan","year":"2002","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB20","doi-asserted-by":"crossref","first-page":"1446","DOI":"10.1287\/mnsc.48.11.1446.267","article-title":"Effective zero inventory ordering policies for the single-warehouse multi-retailer problem with piecewise linear cost","volume":"48","author":"Chan","year":"2002","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB21","unstructured":"Chan, L.M.A., D. Simchi-Levi, J. Swann (2001). Effective Dynamic Pricing Strategies with Stochastic Demand. Massachusetts Institute of Technology"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB22","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1287\/mnsc.46.3.436.12069","article-title":"Quantifying the Bullwhip effect in a simple supply chain: the impact of forecasting, lead times and information","volume":"46","author":"Chen","year":"2000","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB23","doi-asserted-by":"crossref","unstructured":"Chen, X., D. Simchi-Levi (2002a). Coordinating inventory control and pricing strategies with random demand and fixed ordering cost: The finite horizon case. Massachusetts Institute of Technology","DOI":"10.1287\/msom.5.1.59.12763"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB24","doi-asserted-by":"crossref","unstructured":"Chen, X., D. Simchi-Levi (2002b). Coordinating Inventory Control and Pricing Strategies with Random Demand and Fixed Ordering Cost: The Infinite Horizon Case. Massachusetts Institute of Technology","DOI":"10.1287\/msom.5.1.59.12763"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB25","unstructured":"Cook, T. (2000) Creating Competitive Advantage in the Airline Industry. Seminar sponsored by the MIT Global Airline Industry Program and the MIT Operations Research Center"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB26","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/mnsc.23.8.789","article-title":"Location of bank accounts to optimize float: An analytical study of exact and approximate algorithms","volume":"23","author":"Cornu\u00e9jols","year":"1977","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB27","doi-asserted-by":"crossref","unstructured":"Crainic, T.G., A. Frangioni, B. Gendron (2001). Bundle-based relaxation methods for multicommodity capacitated fixed charge network design problems. Discrete Applied Mathematics, 112, 73\u201399","DOI":"10.1016\/S0166-218X(00)00310-3"},{"issue":"3","key":"10.1016\/S0927-0507(03)11002-X_BIB28","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/S0377-2217(96)00298-6","article-title":"Planning models for freight transportation","volume":"97","author":"Crainic","year":"1997","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB29","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0191-2615(86)90019-6","article-title":"Multicommodity, multimode freight transportation: A general modeling and algorithmic framework for the service network design problem","volume":"20B","author":"Crainic","year":"1986","journal-title":"Transportation Research B: Methodology"},{"issue":"4","key":"10.1016\/S0927-0507(03)11002-X_BIB30","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1287\/trsc.26.4.280","article-title":"Design of regular intercity driver routes for the LTL motor carrier industry","volume":"26","author":"Crainic","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB32","unstructured":"Croxton, K. L., B. Gendron, T. L. Magnanti (2000). A comparison of mixed-integer programming models for non-convex piecewise linear cost minimization problems. Publication CRT-2000-31, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB31","doi-asserted-by":"crossref","unstructured":"Croxton K. L., B. Gendron, T. L. Magnanti (2003). Models and methods for merge-in-transit operations. Transportation Science 37, 1\u201322","DOI":"10.1287\/trsc.37.1.1.12822"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB33","series-title":"Network and Discrete Location: Models, Algorithms and Applications","author":"Daskin","year":"1995"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB34","unstructured":"DeMartini, C., A. M. Kwasnica, J. O. Ledyard, D. Porter (1999). A New and Improved Design for Multi-Object Iterative Auctions. Working paper 1054, Division of the Humanities and Social Sciences, California Institute of Technology"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB35","unstructured":"Eliashberg, J., R. Steinberg (1991). Marketing-production joint decision making, in: J. Eliashberg, J.D. Lilien (eds.), Management Science in Marketing, Volume 5 of Handbooks in Operations Research and Management Science, North Holland, Amsterdam"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB36","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","article-title":"Send-and-split method for minimum-concave-cost network flow","volume":"12","author":"Erickson","year":"1987","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB37","first-page":"B378","article-title":"An algorithm for separable nonconvex programming problems","volume":"18","author":"Falk","year":"1969","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB38","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/opre.41.4.669","article-title":"A primal partitioning solution for multi-commodity network flow problem","volume":"41","author":"Farvolden","year":"1993","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB39","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1287\/trsc.28.3.256","article-title":"Subgradient methods for the service network design problem","volume":"28","author":"Farvolden","year":"1994","journal-title":"Transportation Science"},{"issue":"3","key":"10.1016\/S0927-0507(03)11002-X_BIB40","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.47.3.454","article-title":"Combined pricing and inventory control under uncertainty","volume":"47","author":"Federgruen","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB41","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1002\/1520-6750(199010)37:5<707::AID-NAV3220370509>3.0.CO;2-5","article-title":"The dynamic lot size model with quantity discount","volume":"37","author":"Federgruen","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB42","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.37.8.909","article-title":"A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlogn) or O(n) time","volume":"37","author":"Federgruen","year":"1991","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0927-0507(03)11002-X_BIB43","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1145\/285055.285059","article-title":"A threshold of lnn for approximating set cover","volume":"45","author":"Feige","year":"1998","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB44","unstructured":"Fujishima, Y., K. Leyton-Brown, Y. Shoham (1999). Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches. Working paper, Stanford University"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB45","doi-asserted-by":"crossref","first-page":"999","DOI":"10.1287\/mnsc.40.8.999","article-title":"Optimal dynamic pricing of inventories with stochastic demand over finite horizons","volume":"40","author":"Gallego","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB46","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02061657","article-title":"Topological design of telecommunications networks-local access design methods","volume":"33","author":"Gavish","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB47","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0377-2217(79)90144-9","article-title":"Concave cost minimization on networks","volume":"3","author":"Gallo","year":"1979","journal-title":"European Journal of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB48","series-title":"Computers and Intractability","first-page":"223","author":"Garey","year":"1979"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB49","unstructured":"Gendron, B., T. G. Crainic (1994). Relaxations for multicommodity capacitated network design problems, publication CRT-965, Centre de recherche sur les transports. Universit\u00e9 de Montr\u00e9al, 1994"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB50","series-title":"Telecommunications Network Planning","first-page":"1","article-title":"Multicommodity capacitated network design","author":"Gendron","year":"1999"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB51","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02283688","article-title":"Minimum concave-cost network flow problems: applications, complexity, and algorithms","volume":"25","author":"Guisewite","year":"1990","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB52","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1002\/net.3230080402","article-title":"The complexity of the network design problem","volume":"8","author":"Johnson","year":"1978","journal-title":"Networks"},{"issue":"4","key":"10.1016\/S0927-0507(03)11002-X_BIB53","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1287\/opre.38.4.711","article-title":"The joint replenishment problem: new heuristics and worst case performance bounds","volume":"38","author":"Joneja","year":"1990","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB54","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"issue":"2","key":"10.1016\/S0927-0507(03)11002-X_BIB55","first-page":"58","article-title":"Flexed pricing","volume":"44","author":"Kay","year":"1998","journal-title":"Datamation"},{"issue":"4","key":"10.1016\/S0927-0507(03)11002-X_BIB56","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1287\/mnsc.46.4.586.12054","article-title":"A combinatorial auction with multiple winners for universal service","volume":"46","author":"Kelly","year":"2000","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB57","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1057\/jors.1986.84","article-title":"A lagrangian relaxation heuristic for capacitated facility location with single-source constraints","volume":"37","author":"Klincewicz","year":"1986","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB58","unstructured":"Ledyard, J.O. (2000). A Brief History of Combined Value Auction Mechanisms: Theory and Practice. California Institute of Technology"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB59","unstructured":"Ledyard, J.O., M. Olson, D. Porter, J.A. Swanson, D.P. Torma (2000). The First Use of a Combined Value Auction for Transportation Services. Working paper 1093, Division of the Humanities and Social Sciences, California Institute of Technology"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB60","unstructured":"Lee, C.-Y., S. \u00c7entikaya, W. Jaruphongsa (2000). A Dynamic Model for Inventory Lot-Sizing and Outbound Shipment Consolidation at a Third Party Warehouse. Texas A&M"},{"issue":"5","key":"10.1016\/S0927-0507(03)11002-X_BIB61","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/mnsc.46.5.626.12047","article-title":"The value of information sharing in a two-level supply chain","volume":"46","author":"Lee","year":"2000","journal-title":"Management Science"},{"issue":"9","key":"10.1016\/S0927-0507(03)11002-X_BIB62","first-page":"33","article-title":"Ford heads the profits","volume":"16","author":"Leibs","year":"2000","journal-title":"CFO The Magazine"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB63","unstructured":"Leyton-Brown, K., Y. Shoham, M. Tennenholtz (2000). An Algorithm for Multi-Unit Combinatorial Auctions. Conference Proceedings of the American Association for Artificial Intelligence. Austin, Texas"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB64","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.18.1.1","article-title":"Network design and transportation planning: models and algorithms","volume":"18","author":"Magnanti","year":"1984","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB65","unstructured":"Melkote, S. (1996). Integrated Models of Facility Location and Network Design. Ph.D. Thesis, Northwestern University"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB66","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/trsc.33.2.233","article-title":"Revenue management: research overview and prospects","volume":"33","author":"McGill","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB67","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1002\/net.3230190305","article-title":"Network synthesis and optimum network design problems: models, solution methods and applications","volume":"19","author":"Minoux","year":"1989","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB68","series-title":"Discrete Location Theory","author":"Mirchandani","year":"1990"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB69","unstructured":"Muriel, A., F. Munshi (2002). Capacitated Multicommodity Network Flows with Piecewise Linear Concave Costs. Working paper, University of Massachusetts, Amherst"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB70","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","article-title":"An efficient algorithm for the 0-1 knapsack problem","volume":"23","author":"Nauss","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB71","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","article-title":"An algorithm for the fixed-charged assigning users to sources problem","volume":"34","author":"Neebe","year":"1983","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB72","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/opre.47.2.183","article-title":"Pricing and the newsvendor model: a review with extensions","volume":"47","author":"Petruzzi","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB73","first-page":"197","article-title":"Efficient algorithms for the capacitated concentrator location problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB74","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1287\/trsc.30.4.291","article-title":"Production, transportation and distribution planning in a multi-commodity tri-echelon system","volume":"30","author":"Pirkul","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB75","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1287\/mnsc.17.7.411","article-title":"On the optimality of the generalized (s, S) policies","volume":"17","author":"Porteus","year":"1971","journal-title":"Management Science"},{"issue":"4","key":"10.1016\/S0927-0507(03)11002-X_BIB76","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1287\/trsc.20.4.246","article-title":"A local improvement heuristic for the design of less-than-truckload motor carrier networks","volume":"20","author":"Powell","year":"1986","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S0927-0507(03)11002-X_BIB77","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/opre.37.1.12","article-title":"Design and implementation of an interactive optimization system for network design in the motor carrier industry","volume":"37","author":"Powell","year":"1989","journal-title":"Operations Research"},{"issue":"8","key":"10.1016\/S0927-0507(03)11002-X_BIB78","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","article-title":"Computationally manageable combinational auctions","volume":"44","author":"Rothkopf","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB79","doi-asserted-by":"crossref","first-page":"1416","DOI":"10.1287\/mnsc.31.11.1416","article-title":"98%-Effective integer-ratio lot-sizing for one-warehouse multi-retailer systems","volume":"31","author":"Roundy","year":"1985","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB80","unstructured":"Sandholm, T. (1999). An algorithm for winner determination in combinatorial auctions. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (JCAI), Stockholm, Sweden"},{"issue":"1\u20132","key":"10.1016\/S0927-0507(03)11002-X_BIB81","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0167-9236(99)00066-4","article-title":"Approaches to winner determination in combinatorial auctions","volume":"28","author":"Sandholm","year":"2000","journal-title":"Decision Support Systems"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB82","unstructured":"Scarf, H. (1960). The optimality of (s, S) policies for the dynamic inventory problem. Proceedings of the 1st Stanford Symposium on Mathematical Methods in the Social Sciences, Stanford University Press, Stanford, CA"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB83","unstructured":"Shapiro, J.F. (1998). Bottom-up vs. top-down approaches to supply chain modeling, in: Tayur, Ganeshan, Magazine (eds.), Quantitative Models for Supply Chain Management, Kluwer Academic Publishers, Boston, pp. 737\u2013760"},{"issue":"6","key":"10.1016\/S0927-0507(03)11002-X_BIB84","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/mnsc.44.6.831","article-title":"An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs","volume":"44","author":"Shaw","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB85","unstructured":"Shen, Z.J., D. Simchi-Levi, C.P. Teo (2000). Approximation Algorithms for the Single-Warehouse Multi-Retailer Problem with Piecewise Linear Cost Structures. National University of Singapore"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB86","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1287\/opre.22.2.373","article-title":"Optimal facility location with concave costs","volume":"22","author":"Soland","year":"1971","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB87","unstructured":"Stenger, A.J., 1994. Distribution resource planning, in: Robeson and Copacino (eds.), The Logistics Handbook, Free Press, New York, pp. 391\u2013410"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB88","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","article-title":"A polyhedral approach to multicommodity survivable network design","volume":"68","author":"Stoer","year":"1994","journal-title":"Numerische Mathematik"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB89","series-title":"Quantitative Models in Supply Chain Management","author":"Tayur","year":"2000"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB90","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1287\/opre.22.3.513","article-title":"Price and production decisions with random demand","volume":"26","author":"Thomas","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB91","doi-asserted-by":"crossref","unstructured":"Toth, P., D. Vigo (2001). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications","DOI":"10.1137\/1.9780898718515"},{"issue":"2","key":"10.1016\/S0927-0507(03)11002-X_BIB92","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.26.2.339.10552","article-title":"Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems","volume":"26","author":"Van Hoesel","year":"2001","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB93","doi-asserted-by":"crossref","unstructured":"Van Mieghem, J. A., M. Dada (1999). Price versus production postponement: capacity and competition. Management Science 45(12), 1631\u20131649","DOI":"10.1287\/mnsc.45.12.1631"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB94","unstructured":"de Vries, S., R. Vohra (2000). Combinatorial auctions: A survey. INFORMS Journal of Computing 15"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB95","doi-asserted-by":"crossref","unstructured":"Wagelmans, A., S. Van Hoesel, A. Kolen, (1992). Economic lot sizing \u2013 An O(nlogn) algorithm that runs in linear time in the Wagner\u2013Whitin case. Operations Research 40, S145\u2013S156 Suppl. 1, Jan\u2013Feb 1992","DOI":"10.1287\/opre.40.1.S145"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB96","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","article-title":"Dynamic version of the economic lot sizing model","volume":"5","author":"Wagner","year":"1958","journal-title":"Management Science"},{"issue":"1","key":"10.1016\/S0927-0507(03)11002-X_BIB97","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1287\/moor.24.1.106","article-title":"Minimum-aggregate-concave-cost multicommodity flows in strong-series-parallel networks","volume":"24","author":"Ward","year":"1999","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB98","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1287\/mnsc.2.1.61","article-title":"Inventory control and price theory","volume":"2","author":"Whitin","year":"1955","journal-title":"Management Science"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB99","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/net.3230010205","article-title":"Minimum cost routing for dynamic network models","volume":"1","author":"Yaged","year":"1971","journal-title":"Networks"},{"key":"10.1016\/S0927-0507(03)11002-X_BIB100","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1287\/mnsc.14.7.429","article-title":"Minimum concave cost flows in certain networks","volume":"14","author":"Zangwill","year":"1968","journal-title":"Management Science"}],"container-title":["Handbooks in Operations Research and Management Science","Supply Chain Management: Design, Coordination and Operation"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,4,6]],"date-time":"2020-04-06T23:52:21Z","timestamp":1586217141000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S092705070311002X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9780444513281"],"references-count":100,"URL":"https:\/\/doi.org\/10.1016\/s0927-0507(03)11002-x","relation":{},"ISSN":["0927-0507"],"issn-type":[{"value":"0927-0507","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}