A model-based approach and analysis for multi-period networks
From MaRDI portal
Publication:353173
DOI10.1007/S10957-012-0183-6zbMath1267.90163OpenAlexW2049716120MaRDI QIDQ353173
Publication date: 12 July 2013
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-012-0183-6
Related Items (3)
Time-dependent optimization of a multi-item uncertain supply chain network: a hybrid approximation algorithm ⋮ A feasibility evaluation approach for time-evolving multi-item production–distribution networks ⋮ A decomposition-based approach for the multiperiod multiproduct distribution planning problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- Partitioning mathematical programs for parallel solution
- Decomposition Principle for Linear Programs
- The Decomposition Algorithm for Linear Programs
- Revised dantzig-wolfe decomposition for staircase-structured linear programs
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- 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
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
This page was built for publication: A model-based approach and analysis for multi-period networks
