The Logic of Logistics

DOI10.1007/978-1-4614-9149-1zbMath1327.90020MaRDI QIDQ2851343

Julien Bramel, Xin Chen, David Simchi-Levi

Publication date: 10 October 2013

Published in: Springer Series in Operations Research and Financial Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-9149-1

zbMATH Keywords

competition; vehicle routing; approximation; cooperation; pricing; logistics; supply chain networks; lotsizing

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90B06: Transportation, logistics and supply chain management

90B30: Production models

90B10: Deterministic network models in operations research

90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming

90B80: Discrete location and assignment

Related Items

Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information, Preservation of Structural Properties in Optimization with Decisions Truncated by Random Variables and Its Applications, Technical Note—Error Noted in “Order-Based Cost Optimization in Assemble-to-Order Systems” by Lu and Song (2005), Unnamed Item, A survey of fundamental operations on discrete convex functions of various kinds, On basic operations related to network induction of discrete convex functions, Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier, A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility, Integrated Multiresource Capacity Planning and Multitype Patient Scheduling, Discrete Midpoint Convexity, Automated repricing and ordering strategies in competitive markets, Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs, Multiple Exchange Property for M^♮-Concave Functions and Valuated Matroids, Pricing, coalition stability, and profit allocation in the pull assembly supply chains under competition, Recent progress on integrally convex functions, Continuity of discounted values and the structure of optimal policies for <scp>periodic‐review</scp> inventory systems with setup costs, Robust facility location in reverse logistics, Flexible open shop scheduling problem to minimize makespan, Single-item dynamic lot-sizing problems: an updated survey, Simpler exchange axioms for M-concave functions on generalized polymatroids, A new approach to two-location joint inventory and transshipment control via $L^{\text{natural}}$-convexity, Directed discrete midpoint convexity, Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs, Optimising small-scale electronic commerce supply chain operations: a dynamic cost-sharing contract approach, Note on the polyhedral description of the Minkowski sum of two L-convex sets, Optimal inventory policy for fast-moving consumer goods under e-commerce environment, Allocation inequality in cost sharing problem, Joint pricing and inventory replenishment decisions with returns and expediting under reference price effects, Dynamic repositioning for vehicle sharing with setup costs, Dynamic Capacity Management with General Upgrading, Technical Note—Dynamic Pricing with Gain-Seeking Reference Price Effects, Coordinating Inventory Control and Pricing Strategies for Perishable Products, Technical Note—A Risk- and Ambiguity-Averse Extension of the Max-Min Newsvendor Order Formula, Dynamic Stochastic Inventory Management with Reference Price Effects