Tree decomposition and postoptimality analysis in discrete optimization

Computer Science – Discrete Mathematics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

19 pages, 5 fugures

Scientific paper

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Tree decomposition and postoptimality analysis in discrete optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tree decomposition and postoptimality analysis in discrete optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree decomposition and postoptimality analysis in discrete optimization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-63647

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.