M. Tavana, K. Khalili-danghani, and A. R. Abtahi, A fuzzy multidimensional multiple-choice knapsack model for project portfolio selection using an evolutionary algorithm, Annals of Operations Research, vol.24, issue.4, pp.449-483, 2013.
DOI : 10.1007/s10479-013-1387-3

P. Chang, L. , and J. , A fuzzy DEA and knapsack formulation integrated model for project selection, Computers & Operations Research, vol.39, issue.1, pp.112-125, 2012.
DOI : 10.1016/j.cor.2010.10.021

G. J. Beaujon, S. P. Marin, and G. C. Mcdonald, Balancing and optimizing a portfolio of R&D projects, Naval Research Logistics, vol.40, issue.1, pp.18-40, 2001.
DOI : 10.1002/1520-6750(200102)48:1<18::AID-NAV2>3.0.CO;2-7

G. Mavrotas, D. Diakoulaki, and A. Kourentzis, Selection among ranked projects under segmentation, policy and logical constraints, European Journal of Operational Research, vol.187, issue.1, pp.177-192, 2008.
DOI : 10.1016/j.ejor.2007.03.010
URL : http://dspace.lib.ntua.gr/handle/123456789/19135

J. Herbots, W. Herroelen, and R. Leus, Dynamic order acceptance and capacity planning on a single bottleneck resource, Naval Research Logistics, vol.22, issue.8, pp.874-889, 2007.
DOI : 10.1002/nav.20259
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.619.2452

H. Kellerer and U. Pferschy, Improved Dynamic Programming in Connection with an FPTAS for the Knapsack Problem, Journal of Combinatorial Optimization, vol.8, issue.1, pp.5-11, 2004.
DOI : 10.1023/B:JOCO.0000021934.29833.6b

A. Caprara, H. Kellerer, U. Pferschy, and D. Pisinger, Approximation algorithms for knapsack problems with cardinality constraints, European Journal of Operational Research, vol.123, issue.2, pp.333-345, 2000.
DOI : 10.1016/S0377-2217(99)00261-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.11.6626

M. Mastrolilli and M. Hutter, Hybrid rounding techniques for knapsack problems, Discrete Applied Mathematics, vol.154, issue.4, pp.640-649, 2006.
DOI : 10.1016/j.dam.2005.08.004
URL : http://doi.org/10.1016/j.dam.2005.08.004

C. Bazgan, H. Hugot, and D. Vanderpoorten, Implementing an efficient fptas for the 0???1 multi-objective knapsack problem, European Journal of Operational Research, vol.198, issue.1, pp.47-56, 2009.
DOI : 10.1016/j.ejor.2008.07.047

V. Sristava and F. Bullo, Knapsack problems with sigmoid utilities: Approximation algorithms via hybrid optimization, European Journal of Operational Research, vol.236, issue.2, pp.488-498, 2014.
DOI : 10.1016/j.ejor.2013.12.035

A. Guler, U. G. Nuriyev, M. E. Berberler, and F. Nurieva, Algorithms with guarantee value for knapsack problems, Optimization, vol.2, issue.4, pp.477-488, 2012.
DOI : 10.1145/321906.321909

F. L. Wu, Z. Yen, Y. H. Hou, and Y. X. Ni, Applications of AI techniques to generation planning and investment, IEEE Power Engineering Society General Meeting, pp.936-940, 2004.

X. M. Li, S. Fang, Y. Tian, and X. L. Guo, Expanded Model of the Project Portfolio Selection Problem with Divisibility, 2014.

A. Dolgui and J. Proth, Supply Chain Engineering: Useful Methods and Techniques, 2010.
DOI : 10.1007/978-1-84996-017-5
URL : https://hal.archives-ouvertes.fr/emse-00675734

K. Schemeleva, X. Delorme, A. Dolgui, F. Grimaud, and M. Y. Kovalyov, Lot-sizing on a single imperfect machine: ILP models and FPTAS extensions, Computers & Industrial Engineering, vol.65, issue.4, pp.561-569
DOI : 10.1016/j.cie.2013.04.002
URL : https://hal.archives-ouvertes.fr/emse-00881337

H. Kellerer, U. Pferschy, and D. Pisinger, Knapsack Problems, 2004.
DOI : 10.1007/978-3-540-24777-7

L. A. Mclay and S. H. Jacobson, Algorithms for the bounded set-up knapsack problem, Discrete Optimization, vol.4, issue.2, pp.206-412, 2007.
DOI : 10.1016/j.disopt.2006.11.002

M. A. Posypkin, I. Sigal, and . Kh, Speedup estimates for some variants of the parallel implementations of the branch-and-bound method, Computational Mathematics and Mathematical Physics, vol.46, issue.12, pp.2189-2202, 2006.
DOI : 10.1134/S0965542506120165

]. Neil, E. T. Kerlin, and S. , A Simple 510 2 O( ? x) Algorithm for PARTITION and SUBSET SUM, 2010.

A. Bar-noy, M. J. Golin, and Y. Zhang, Online Dynamic Programming Speedups, Theory of Computing Systems, vol.27, issue.3, pp.429-445, 2009.
DOI : 10.1007/s00224-009-9166-x

D. Eppstein, Z. Galil, G. , and R. , Speeding up dynamic programming, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, 1988.
DOI : 10.1109/SFCS.1988.21965
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.39.7067

A. P. Wagelmans and A. E. Gerodimos, Improved dynamic programs for some batching problems involving the maximum lateness criterion, Operations Research Letters, vol.27, issue.3, pp.109-118, 2000.
DOI : 10.1016/S0167-6377(00)00040-7
URL : http://hdl.handle.net/10419/85712

D. X. Shaw and A. P. Wagelmans, An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs, Management Science, vol.44, issue.6, pp.831-838, 1998.
DOI : 10.1287/mnsc.44.6.831
URL : http://repub.eur.nl/pub/1353/1353.pdf

S. Kameshwaran and Y. Narahari, Nonconvex piecewise linear knapsack problems, European Journal of Operational Research, vol.192, issue.1, pp.56-525, 2009.
DOI : 10.1016/j.ejor.2007.08.044
URL : http://eprints.exchange.isb.edu/170/

E. R. Gafarov, A. Dolgui, A. A. Lazarev, W. , and F. , A Graphical Approach to Solve an Investment Optimization Problem, Journal of Mathematical Modelling and Algorithms in Operations Research, vol.65, issue.6, pp.597-614, 2014.
DOI : 10.1007/s10852-013-9248-2
URL : https://hal.archives-ouvertes.fr/emse-00926121

A. A. Lazarev, W. , and F. , A graphical realization of the dynamic programming method for solving <mml:math altimg="si18.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>N</mml:mi><mml:mi>P</mml:mi></mml:math>-hard combinatorial problems, Computers & Mathematics with Applications, vol.58, issue.4, pp.619-631, 2009.
DOI : 10.1016/j.camwa.2009.06.008

A. V. Aho, J. E. Hopcroft, J. D. Ullman, S. Chubanov, M. Y. Kovalyov et al., Data Structures and Algorithms An FPTAS for a Single-Item Capacitated Economic Lot-Sizing Problem with Monotone Cost Structure, Mathematical Programming, vol.28, issue.106, pp.535-453, 1983.

E. R. Gafarov, A. Dolgui, W. , and F. , A new graphical approach for solving single-machine scheduling problems approximately, International Journal of Production Research, vol.5, issue.13, pp.3762-3777, 2014.
DOI : 10.1080/00207543.2012.676683
URL : https://hal.archives-ouvertes.fr/emse-01083341

E. R. Gafarov, A. A. Lazarev, W. , and F. , Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one, Annals of Operations Research, vol.2, issue.9???10, pp.247-261, 2012.
DOI : 10.1007/s10479-011-1055-4