Computer Science – Data Structures and Algorithms
Scientific paper
2006-02-06
Computer Science
Data Structures and Algorithms
Scientific paper
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally unimodular. Still, sometimes it is possible to build an integer solution with the same cost from the fractional solution. Examples are two scheduling problems and the single disk prefetching/caching problem. We show that problems such as the three previously mentioned can be separated into two subproblems: (1) finding an optimal feasible set of slots, and (2) assigning the jobs or pages to the slots. It is straigthforward to show that the latter can be solved greedily. We are able to solve the former with a totally unimodular linear program, from which we obtain simple combinatorial algorithms with improved worst case running time.
Durr Christoph
Hurand Mathilde
No associations
LandOfFree
Finding total unimodularity in optimization problems solved by linear programs 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 Finding total unimodularity in optimization problems solved by linear programs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding total unimodularity in optimization problems solved by linear programs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-730498