Optimal linear approximation in project compression
- 1 December 1984
- journal article
- Published by Taylor & Francis in IIE Transactions
- Vol. 16 (4) , 339-347
- https://doi.org/10.1080/07408178408975253
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Error Analysis for Convex Separable Programs: The Piecewise Linear Approximation and The Bounds on The Optimal Objective ValueSIAM Journal on Applied Mathematics, 1978
- Objective function approximations in mathematical programmingMathematical Programming, 1977
- A Dynamic Programming Solution to Cost-Time Tradeoff for CPMManagement Science, 1975
- Minimum Cost Multicommodity Circulation Problem with Convex Arc-CostsTransportation Science, 1974
- An Efficient Minimal Cost Flow AlgorithmManagement Science, 1973
- Critical Path Problems with Concave Cost-Time CurvesManagement Science, 1972
- An algorithm for approximating convex functions by means by first degree splinesThe Computer Journal, 1971
- Algorithms for Piecewise Straight Line ApproximationsThe Computer Journal, 1968
- The minimal cost flow problem with convex costsNaval Research Logistics Quarterly, 1965
- An algorithm for solving the transportation problem when the shipping cost over each route is convexNaval Research Logistics Quarterly, 1959