A decomposition-based approach for the multiperiod multiproduct distribution planning problem
DOI10.1155/2014/825058zbMATH Open1442.90028DBLPjournals/jam/HosseiniSU14OpenAlexW2106048606WikidataQ59052607 ScholiaQ59052607MaRDI QIDQ2336751FDOQ2336751
Publication date: 19 November 2019
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/825058
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
Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Title not available (Why is that?)
- An Efficient Heuristic Procedure for Partitioning Graphs
- The Decomposition Algorithm for Linear Programs
- Title not available (Why is that?)
- Decomposing Matrices into Blocks
- Decomposition Principle for Linear Programs
- Title not available (Why is that?)
- Constructing Maximal Dynamic Flows from Static Flows
- A survey of dynamic network flows
- Partitioning mathematical programs for parallel solution
- A model-based approach and analysis for multi-period networks
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry
- Slice models in general purpose modeling systems: An application to DEA
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
- An introduction to dynamic generative networks: minimum cost flow
- Time-varying network optimization.
- Multicommodity network flows: The impact of formulation on decomposition
- Hyper-sparsity in the revised simplex method and how to exploit it
- A generalized upper bounding algorithm for multicommodity network flow problems
- Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method
- Determining the optimal flows in zero-time dynamic networks
- Maximum Multicommodity Flows over Time without Intermediate Storage
Cited In (2)
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)
