A decomposition-based approach for the multiperiod multiproduct distribution planning problem

DOI10.1155/2014/825058MaRDI QIDQ2336751zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Yanyan Li

Publication date 19 November 2019

Published in Journal of Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.1155/2014/825058

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Recommendations

• scientific article; zbMATH DE number 975772
• A decomposition-based heuristic for the multiple-product inventory-routing problem
• scientific article; zbMATH DE number 1450254
• A Lagrangian relaxation approach to multi-period inventory/distribution planning
• A Lower Bound and an Efficient Heuristic for Multistage Multiproduct Distribution Systems
• Linear programming based decomposition methods for inventory distribution systems
• scientific article; zbMATH DE number 1738636
• scientific article; zbMATH DE number 711782

Cites work

• scientific article; zbMATH DE number 1834587 (Why is no real title available?)
• scientific article; zbMATH DE number 6402977 (Why is no real title available?)
• A generalized upper bounding algorithm for multicommodity network flow problems
• A model-based approach and analysis for multi-period networks
• A survey of dynamic network flows
• An Efficient Heuristic Procedure for Partitioning Graphs
• An introduction to dynamic generative networks: minimum cost flow
• Constructing maximal dynamic flows from static flows
• Decomposing Matrices into Blocks
• Decomposition Principle for Linear Programs
• Determining the optimal flows in zero-time dynamic networks
• Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry
• Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method
• Hyper-sparsity in the revised simplex method and how to exploit it
• Maximum multicommodity flows over time without intermediate storage
• Multicommodity network flows: The impact of formulation on decomposition
• Network flows. Theory, algorithms, and applications.
• Partitioning mathematical programs for parallel solution
• Real analysis
• Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
• Revised dantzig-wolfe decomposition for staircase-structured linear programs
• Slice models in general purpose modeling systems: An application to DEA
• The Decomposition Algorithm for Linear Programs
• The structure and dynamics of networks
• Time-varying network optimization.

Cited in

(3)

• Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm
• A model-based approach and analysis for multi-period networks
• scientific article; zbMATH DE number 975772 (Why is no real title available?)

This page was built for publication: A decomposition-based approach for the multiperiod multiproduct distribution planning problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2336751)