A decomposition-based approach for the multiperiod multiproduct distribution planning problem
From MaRDI portal
Publication:2336751
DOI10.1155/2014/825058zbMath1442.90028OpenAlexW2106048606WikidataQ59052607 ScholiaQ59052607MaRDI QIDQ2336751
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
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A model-based approach and analysis for multi-period networks
- Discrete and continuous time representations and mathematical models for large production scheduling problems: a case study from the pharmaceutical industry
- An introduction to dynamic generative networks: minimum cost flow
- Time-varying network optimization.
- A survey of dynamic network flows
- Multicommodity network flows: The impact of formulation on decomposition
- Partitioning mathematical programs for parallel solution
- Determining the optimal flows in zero-time dynamic networks
- Hyper-sparsity in the revised simplex method and how to exploit it
- Maximum Multicommodity Flows over Time without Intermediate Storage
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- An Efficient Heuristic Procedure for Partitioning Graphs
- Decomposing Matrices into Blocks
- Slice models in general purpose modeling systems: An application to DEA
- Constructing Maximal Dynamic Flows from Static Flows
- Generalized Networks, Generalized Upper Bounding and Decomposition of the Convex Simplex Method
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
- A generalized upper bounding algorithm for multicommodity network flow problems
This page was built for publication: A decomposition-based approach for the multiperiod multiproduct distribution planning problem