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-Reference-Cited by-同舟云学术

A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems

Author:

Lazarev Alexander A.,Werner Frank

Publisher

Elsevier BV

Subject

Computational Mathematics,Computational Theory and Mathematics,Modelling and Simulation

Reference8 articles.

1. Dynamic Programming;Bellman,1957

3. Discrete Programming;Korbut,1969

4. Approximative Methods and Applied Problems of Discrete Programming;Finkelstein,1976

5. Combinatorial Optimization: Algorithms and Complexity;Papadimitrou,1982

Cited by 18 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献