Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization

  title={Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization},
  author={Oleg Shcherbina},
Solving discrete optimization problems (DOP) can be a rather hard task. Many real DOPs contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. There are few approaches for solving DOPs: tree search approaches (e.g., branch and bound), relaxation and decomposition methods. Large DOPs can be solved due to their special structure. Among decomposition approaches we can mention poorly known local decomposition algorithms using the… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 11 references

Kolotoglu. Branch and Tree Decomposition Techniques for Discrete Optimization

  • Illya V. Hicks, Arie M.C.A. Koster, Elif
  • 2005

Local algorithms for block-tree problems of discrete programming, U.S.S.R

  • O. A. Shcherbina
  • Comput. Math. Math. Phys
  • 1985

Local algorithms for blocktree problems of discrete programming

  • OA Shcherbina
  • U . S . S . R . Comput . Math . Math . Phys .
  • 1985

On local algorithms of solving discrete optimization problems

  • OA Shcherbina
  • Problems of Cybernetics . Moscow
  • 1983

Similar Papers

Loading similar papers…