1. Generalization of the dynamic programming scheme;Bugaev;Automation and Remote Control,2009
2. Computers and Intractability: A Guide to the Theory of NP-Completeness (Series of Books in the Mathematical Sciences);Garey,1979
3. Dynamic programming and discreet multi-criteria optimization;Kogan,2005
4. Solving of a bicriteria knapsack problem by the branch-and-bound method;Kogan;Mezhvuzovskiy sbornik nauchnyh trudov,2004
5. The discretization problem: analysis of computational complexity and polynomially solvable subclasses;Kogan;Diskr. Mat.,1996