A priori error bounds for procurement commodity aggregation in logistics planning models
From MaRDI portal
Publication:4154353
DOI10.1002/NAV.3800240202zbMATH Open0375.90040OpenAlexW2156551934MaRDI QIDQ4154353FDOQ4154353
Authors: A. M. Geoffrion 
Publication date: 1977
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800240202
Cited In (8)
- Objective function approximations in mathematical programming
- Solving large-scale linear programs by aggregation
- Hierarchical solution of network flow problems
- Strategic production-distribution models: A critical review with emphasis on global supply chain models
- The impact of distance on location problems
- Error bounds for the aggregated convex programming problem
- BOUNDED RATIONALITY IN LONG-TERM PLANNING: A LINEAR PROGRAMMING APPROACH
- A simulation study of some simplification strategies in the development of product-mix models
This page was built for publication: A priori error bounds for procurement commodity aggregation in logistics planning models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154353)
