Approximation solution of the supply management problem

Journal of Applied and Industrial Mathematics

Volumn 1, Issue 4, 2007, Pages 433-441

  Eremeev, A V ^a   Romanova, A A ^b   Servakh, V V ^a   Chauhan, Singh S ^c  

^a SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^b OMSK STATE UNIVERSITY   (Russian Federation)

^c UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 37249071815     PISSN: 19904789     EISSN: 19904797     Source Type: Journal    
DOI: 10.1134/S1990478907040060     Document Type: Article

References (7)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, 1974; Mir, Moscow, 1979).
2. G. V. Gens and E. V. Levner, Effective Approximation Algorithms for Combinatorial Problems, Preprint (Central Econom. Math. Inst., Moscow, 1981).
3. S. S. Chauhan, A. V. Eremeev, A. A. Kolokolov, and V. V. Servakh, "Concave Cost Supply Management Problem for Single Manufacturing Unit," in Applied Optimization, Vol. 94: Supply Chain Optimization: Product/Process Design, Facility Location and Flow Control (Springer, New York, 2005), pp. 167-174.
4. S. S. Chauhan, A. V. Eremeev, A. A. Romanova, V. V. Servakh, and G. J. Woeginger, "Approximation of the Supply Scheduling Problem," Oper. Res. Lett. 33 (3), 249-254 (2005).
5. S. S. Chauhan and J.-M. Proth, "The Concave Cost Supply Problem," European J. Oper. Res. 148 (2), 374-383 (2003).
6. O. Ibarra and C. E. Kim, "Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems," J. Assoc. Comput. Math. 22 (4), 463-468 (1975).
7. G. J. Woeginger, "When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?" INFORMS J. on Computing 12 (1), 57-75 (2000).