Block local elimination algorithms for solving sparse discrete optimization problems

Details Block local elimination algorithms for solving sparse discrete optimization problems Block local elimination algorithms for solving sparse discrete optimization problems

2011-12-29

arxiv.org/abs/1112.6335v2

Computer Science

Discrete Mathematics

arXiv admin note: substantial text overlap with arXiv:0901.3882

Scientific paper

Block elimination algorithms for solving sparse discrete optimization problems are considered. The numerical example is provided. The benchmarking is done in order to define real computational capabilities of block elimination algorithms combined with SYMPHONY solver. Analysis of the results show that for sufficiently large number of blocks and small enough size of separators between the blocks for staircase integer linear programming problem the local elimination algorithms in combination with a solver for solving subproblems in blocks allow to solve such problems much faster than used solver itself for solving the whole problem. Also the capabilities of postoptimal analysis (warm starting) are considered for solving packages of integer linear programming problems for corresponding blocks.

Affiliated with

Also associated with

No associations

Rating

Block local elimination algorithms for solving sparse discrete optimization problems 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 Block local elimination algorithms for solving sparse discrete optimization problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Block local elimination algorithms for solving sparse discrete optimization problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-728607