Tree decomposition and postoptimality analysis in discrete optimization
| dc.creator | Shcherbina, O. | |
| dc.date | 2009-03-25 | |
| dc.date.accessioned | 2026-07-07T12:56:34Z | |
| dc.date.available | 2026-07-07T12:56:34Z | |
| dc.description | Many real discrete optimization problems (DOPs) are $NP$-hard and contain a huge number of variables and/or constraints that make the models intractable for currently available solvers. Large DOPs can be solved due to their special tructure using decomposition approaches. An important example of decomposition approaches is tree decomposition with local decomposition algorithms using the special block matrix structure of constraints which can exploit sparsity in the interaction graph of a discrete optimization problem. In this paper, discrete optimization problems with a tree structural graph are solved by local decomposition algorithms. Local decomposition algorithms generate a family of related DO problems which have the same structure but differ in the right-hand sides. Due to this fact, postoptimality techniques in DO are applied. | |
| dc.description | 19 pages, 5 fugures | |
| dc.identifier | https://arxiv.org/abs/0903.4435 | |
| dc.identifier | http://arxiv.org/abs/0903.4435 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/224626 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | G.2.2 | |
| dc.title | Tree decomposition and postoptimality analysis in discrete optimization | |
| dc.type | text |