Approximation of the supply scheduling problem

Operations Research Letters

Volumn 33, Issue 3, 2005, Pages 249-254

  Chauhan, Satyaveer S ^a   Eremeev, Anton V ^b   Romanova, Anna A ^c   Servakh, Vladimir V ^b   Woeginger, Gerhard J ^d  

^a UNIVERSITÉ DE LORRAINE   (France)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

^c OMSK STATE UNIVERSITY   (Russian Federation)

^d EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation algorithm; Approximation scheme; Combinatorial optimization

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; POLYNOMIAL APPROXIMATION; SCHEDULING; SET THEORY; THEOREM PROVING;

APPROXIMATION ALGORITHM; APPROXIMATION SCHEME; COMBINATORIAL OPTIMIZATION; FULLY POLYNOMIAL TIME APPROXIMATION SCHEME (FPTAS);

PROBLEM SOLVING;

EID: 10044260727     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.04.015     Document Type: Article

References (6)

1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, 1974.
2. S.S. Chauhan, A.V. Eremeev, A.A. Kolokolov, V.V. Servakh, On solving the concave cost supply management problem with a single manufacturing unit, in: Proceedings of the Production System Design, Supply Chain Management and Logistics Conference, 2002, pp. 147-154.
3. S.S. Chauhan, J.-M. Proth, The concave cost supply problem, Eur. J. Oper. Res. 148 (2003) 374-383.
4. M.R. Garey, D.S. Johnson, Computers and Intractability, W.H. Freeman and Co., New York, 1979.
5. O. Ibarra, C.E. Kim, Fast approximation algorithms for the knapsack and sum of subset problems, J. ACM 22 (1975) 463-468.
6. G.J. Woeginger, When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?, INFORMS J. Comput. 12 (2000) 57-75.