Restructuring in Combinatorial Optimization

Details Restructuring in Combinatorial Optimization Restructuring in Combinatorial Optimization

2011-02-08

arxiv.org/abs/1102.1745v1

Computer Science

Data Structures and Algorithms

11 pages, 12 figures

Scientific paper

The paper addresses a new class of combinatorial problems which consist in restructuring of solutions (as structures) in combinatorial optimization. Two main features of the restructuring process are examined: (i) a cost of the restructuring, (ii) a closeness to a goal solution. This problem corresponds to redesign (improvement, upgrade) of modular systems or solutions. The restructuring approach is described and illustrated for the following combinatorial optimization problems: knapsack problem, multiple choice problem, assignment problem, spanning tree problems. Examples illustrate the restructuring processes.

Affiliated with

Also associated with

No associations

Rating

Restructuring in Combinatorial 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 Restructuring in Combinatorial Optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Restructuring in Combinatorial Optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-649830