Highly Influenced

# Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization

@inproceedings{Shcherbina2006NonserialDP, title={Nonserial Dynamic Programming and Tree Decomposition in Discrete Optimization}, author={Oleg Shcherbina}, booktitle={OR}, year={2006} }

- Published 2006 in OR
DOI:10.1007/978-3-540-69995-8_26

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